Operational semantics for declarative multi-paradigm languages
From MaRDI portal
Publication:2456574
DOI10.1016/J.JSC.2004.01.001zbMATH Open1129.68042OpenAlexW1980781982MaRDI QIDQ2456574FDOQ2456574
Authors: Elvira Albert, Michael Hanus, Frank Huch, Germán Vidal, J. 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
Recommendations
- An operational semantics for declarative multi-paradigm languages
- Programming Languages and Systems
- A residualizing semantics for the partial evaluation of functional logic programs.
- Functional Logic Programming: From Theory to Curry
- A concurrent operational semantics for constraint functional logic programming
Logic programming (68N17) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)
Cites Work
- Logic programming with functions and predicates: The language Babel
- Title not available (Why is that?)
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A foundation for higher-order concurrent constraint programming
- Title not available (Why is that?)
- A needed narrowing strategy
- Sequential abstract-state machines capture sequential algorithms
- Title not available (Why is that?)
- Deriving a lazy abstract machine
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- The narrowing-driven approach to functional logic program specialization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Higher-order narrowing with definitional trees
- Kernel-LEAF: A logic plus functional language
- The integration of functions into logic programming: From theory to practice
- Title not available (Why is that?)
- Denotational and operational semantics for prolog
- Title not available (Why is that?)
- An approach to declarative programming based on a rewriting logic
- A mathematical definition of full Prolog
- Operational semantics for declarative multi-paradigm languages
- GOFFIN: Higher-order functions meet concurrent constraints
- Cost-augmented partial evaluation of functional logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Run-Time Profiling of Functional Logic Programs
Cited In (25)
- Singular and plural functions for functional logic programming
- Title not available (Why is that?)
- A structural operational semantics for an Edison like language. II
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- Operational semantics for declarative multi-paradigm languages
- Title not available (Why is that?)
- Transforming Boolean equalities into constraints
- An operational semantics for declarative multi-paradigm languages
- A Relation Algebraic Semantics for a Lazy Functional Logic Language
- Equivalence of two formal semantics for functional logic programs
- A residualizing semantics for the partial evaluation of functional logic programs.
- Rewriting and narrowing for constructor systems with call-time choice semantics
- Compiling a functional logic language: \textit{The Fair Scheme}
- Extra variables can be eliminated from functional logic programs
- Dynamic slicing of lazy functional programs based on redex trails
- Rewriting and Call-Time Choice: The HO Case
- A framework for interpreting traces of functional logic computations
- On a Tighter Integration of Functional and Logic Programming
- Purely functional lazy nondeterministic programming
- Functional Logic Programming: From Theory to Curry
- Rule-based operational semantics for an imperative language
- A structural operational semantics for an Edison-like language
- From Boolean equalities to constraints
- Reporting failures in functional logic programs
Uses Software
This page was built for publication: Operational semantics for declarative multi-paradigm languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456574)
