An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

DOI10.1007/978-3-642-20775-4_7zbMath1327.68074OpenAlexW1827100046MaRDI QIDQ3003516

Daniel Seidel, Janis Voigtländer, Jan Christiansen

Publication date: 27 May 2011

Published in: Functional and Constraint Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20775-4_7

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Implementing a Library for Probabilistic Programming Using Non-strict Non-determinism ⋮ FlatCurry

Uses Software

• Curry

Cites Work

• Operational semantics for declarative multi-paradigm languages
• Equivalence of Two Formal Semantics for Functional Logic Programs
• Transforming Functional Logic Programs into Monadic Functional Programs
• On a Tighter Integration of Functional and Logic Programming
• A Fully Abstract Semantics for Constructor Systems
• Composing programs in a rewriting logic for declarative programming
• An approach to declarative programming based on a rewriting logic
• Semantics of value recursion for Monadic Input/Output

This page was built for publication: An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry