Compiling a Functional Logic Language: The Fair Scheme

DOI10.1007/978-3-319-14125-1_12zbMath1453.68039OpenAlexW632469267MaRDI QIDQ3453653

Sergio Antoy, Andy Jost

Publication date: 30 November 2015

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-14125-1_12

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (1)

Compiling a Functional Logic Language: The Fair Scheme

Uses Software

• KiCS2
• Curry
• TOY
• PAKCS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Programming with narrowing: a tutorial
• Operational semantics for declarative multi-paradigm languages
• Evaluation strategies for functional logic programming
• Lazy Context Cloning for Non-Deterministic Graph Rewriting
• Extra Variables Can Be Eliminated from Functional Logic Programs
• On the correctness of pull-tabbing
• Compiling a Functional Logic Language: The Fair Scheme
• On a Tighter Integration of Functional and Logic Programming
• On the Correctness of Bubbling
• Multi-paradigm Declarative Languages
• Nondeterministic algebraic specifications and nonconfluent term rewriting
• An approach to declarative programming based on a rewriting logic
• Purely functional lazy nondeterministic programming
• Rewriting and narrowing for constructor systems with call-time choice semantics
• A Virtual Machine for Functional Logic Computations
• Overlapping Rules and Logic Variables in Functional Logic Programs

This page was built for publication: Compiling a Functional Logic Language: The Fair Scheme