A proof assistant based formalisation of a subset of sequential core Erlang

DOI10.1007/978-3-030-57761-2_7zbMath1475.68059arXiv2005.11821OpenAlexW3103583943MaRDI QIDQ2037429

Yanyan Li

Publication date: 1 July 2021

Full work available at URL: https://arxiv.org/abs/2005.11821

zbMATH Keywords

formal semanticsoperational semanticsCoqterm rewrite systemErlang formalisationmachine-checked formalisation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Formalization of mathematics in connection with theorem provers (68V20)

Related Items (1)

Program equivalence in an untyped, call-by-value functional language with uncurried functions

Uses Software

• Unnamed Item

This page was built for publication: A proof assistant based formalisation of a subset of sequential core Erlang