Operational semantics for declarative multi-paradigm languages

DOI10.1016/j.jsc.2004.01.001zbMath1129.68042OpenAlexW1980781982MaRDI QIDQ2456574

Michael Hanus, Elvira Albert, Germán Vidal, Frank Huch, Javier Oliver

Publication date: 19 October 2007

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.01.001

zbMATH Keywords

operational semanticsFunctional logic programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Transforming Boolean equalities into constraints, Compiling a Functional Logic Language: The Fair Scheme, A Relation Algebraic Semantics for a Lazy Functional Logic Language, On a Tighter Integration of Functional and Logic Programming, Operational semantics for declarative multi-paradigm languages, An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry, Singular and plural functions for functional logic programming, Rewriting and narrowing for constructor systems with call-time choice semantics, Functional Logic Programming: From Theory to Curry, Purely functional lazy nondeterministic programming, From Boolean Equalities to Constraints, Dynamic slicing of lazy functional programs based on redex trails, Rewriting and Call-Time Choice: The HO Case, Preserving Sharing in the Partial Evaluation of Lazy Functional Programs, Extra Variables Can Be Eliminated from Functional Logic Programs, Equivalence of Two Formal Semantics for Functional Logic Programs, Reporting Failures in Functional Logic Programs, A Framework for Interpreting Traces of Functional Logic Computations

Uses Software

• BABEL
• Haskell
• Erlang
• Kernel-LEAF
• TOY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• GOFFIN: Higher-order functions meet concurrent constraints
• Cost-augmented partial evaluation of functional logic programs
• A mathematical definition of full Prolog
• Operational semantics for declarative multi-paradigm languages
• Kernel-LEAF: A logic plus functional language
• A needed narrowing strategy
• Denotational and operational semantics for prolog
• Logic programming with functions and predicates: The language Babel
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Higher-order narrowing with definitional trees
• The integration of functions into logic programming: From theory to practice
• Deriving a lazy abstract machine
• An approach to declarative programming based on a rewriting logic
• A foundation for higher-order concurrent constraint programming
• Run-Time Profiling of Functional Logic Programs
• Sequential abstract-state machines capture sequential algorithms
• The narrowing-driven approach to functional logic program specialization