The Verse Calculus: A Core Calculus for Deterministic Functional Logic Programming

Functional logic languages have a rich literature, but it is tricky to give them a satisfying semantics. In this paper we describe the Verse calculus, VC, a new core calculus for deterministic functional logic programming. Our main contribution is to equip VC with a small-step rewrite semantics, so...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 7; číslo ICFP; s. 417 - 447
Hlavní autoři: Augustsson, Lennart, Breitner, Joachim, Claessen, Koen, Jhala, Ranjit, Peyton Jones, Simon, Shivers, Olin, Steele Jr, Guy L., Sweeney, Tim
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 30.08.2023
Témata:
Constraint and logic languages
Equational logic and rewriting
Functional languages
Grammars and context-free languages
Multiparadigm languages
Proof theory
Rewrite systems
Semantics
Software and its engineering
Syntax
Theory of computation
choice operator
lambda calculus
logical variables
confluence
normal forms
substitution
functional programming
Verse language
evaluation strategy
unification
Verse calculus
lenient evaluation
declarative programming
skew confluence
even/odd problem
logic programming
rewrite rules
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Functional logic languages have a rich literature, but it is tricky to give them a satisfying semantics. In this paper we describe the Verse calculus, VC, a new core calculus for deterministic functional logic programming. Our main contribution is to equip VC with a small-step rewrite semantics, so that we can reason about a VC program in the same way as one does with lambda calculus; that is, by applying successive rewrites to it. We also show that the rewrite system is confluent for well-behaved terms.
ISSN:2475-1421
2475-1421
DOI:10.1145/3607845