Kernel-LEAF: A logic plus functional language

DOI10.1016/0022-0000(91)90009-TzbMath0717.68013OpenAlexW2078852650MaRDI QIDQ2638759

Giorgio Levi, Corrado Moiso, Catuscia Palamidessi, Elio Giovannetti

Publication date: 1991

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(91)90009-t

zbMATH Keywords

semanticsSLD-resolutionlogic functional language

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (18)

Completeness results for basic narrowing ⋮ Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction ⋮ Level-confluence of conditional rewrite systems with extra variables in right-hand sides ⋮ Ensuring the quasi-termination of needed narrowing computations ⋮ Incremental constraint satisfaction for equational logic programming ⋮ A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. ⋮ Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the Valencian Research Council under grant GV01-424. ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ Lazy narrowing in a graph machine ⋮ Operational semantics for declarative multi-paradigm languages ⋮ Evaluation strategies for functional logic programming ⋮ Relating the implementation techniques of functional and functional logic languages ⋮ Functional Logic Programming: From Theory to Curry ⋮ Programming with narrowing: a tutorial ⋮ The narrowing-driven approach to functional logic program specialization ⋮ Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424. ⋮ A Declarative Debugging System for Lazy Functional Logic Programs ⋮ Higher-order narrowing with definitional trees

Uses Software

• Kernel-LEAF
• PARLOG
• NARROWER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Optimal fixedpoints of logic programs
• Incorporating equality into logic programming via surface deduction
• Conditional rewrite rules: Confluence and termination
• Oriented equational clauses as a programming language
• A theory of complete logic programs with equality
• PARLOG: parallel programming in logic
• Login: a logic programming language with built-in inheritance
• Proving Theorems with the Modification Method
• The Semantics of Predicate Logic as a Programming Language
• Initial Algebra Semantics and Continuous Algebras
• Equality, types, modules, and (why not?) generics for logic programming

This page was built for publication: Kernel-LEAF: A logic plus functional language