Program equivalence in an untyped, call-by-value functional language with uncurried functions
From MaRDI portal
Publication:2693299
DOI10.1016/j.jlamp.2023.100857OpenAlexW4319756006MaRDI QIDQ2693299
Publication date: 20 March 2023
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.14260
Uses Software
Cites Work
- Full abstraction in the lazy lambda calculus
- Foundations of software technology and theoretical computer science. 18th conference, Chennai, India, December 17--19, 1998. Proceedings
- Cauder: a causal-consistent reversible debugger for Erlang
- A theory of reversibility for Erlang
- Proving congruence of bisimulation in functional programming languages
- A proof assistant based formalisation of a subset of sequential core Erlang
- A reversible semantics for Erlang
- Step-Indexed Relational Reasoning for Countable Nondeterminism
- Abstraction and Model Checking of Core Erlang Programs in Maude
- Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring
- Towards Symbolic Execution in Erlang
- Equivalence in functional languages with effects
- Compilation and equivalence of imperative objects
- On coinductive equivalences for higher-order probabilistic functional programs
- Programming Languages and Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
