Operational semantics for declarative multi-paradigm languages
From MaRDI portal
Publication:2456574
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
Cites work
- scientific article; zbMATH DE number 1630028 (Why is no real title available?)
- scientific article; zbMATH DE number 1638666 (Why is no real title available?)
- scientific article; zbMATH DE number 1693041 (Why is no real title available?)
- scientific article; zbMATH DE number 4164128 (Why is no real title available?)
- scientific article; zbMATH DE number 18622 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 1332654 (Why is no real title available?)
- scientific article; zbMATH DE number 1354178 (Why is no real title available?)
- scientific article; zbMATH DE number 1950450 (Why is no real title available?)
- scientific article; zbMATH DE number 1952947 (Why is no real title available?)
- scientific article; zbMATH DE number 1973220 (Why is no real title available?)
- scientific article; zbMATH DE number 2090121 (Why is no real title available?)
- scientific article; zbMATH DE number 773979 (Why is no real title available?)
- scientific article; zbMATH DE number 1420819 (Why is no real title available?)
- scientific article; zbMATH DE number 969074 (Why is no real title available?)
- A foundation for higher-order concurrent constraint programming
- A mathematical definition of full Prolog
- A needed narrowing strategy
- An approach to declarative programming based on a rewriting logic
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Cost-augmented partial evaluation of functional logic programs
- Denotational and operational semantics for prolog
- Deriving a lazy abstract machine
- GOFFIN: Higher-order functions meet concurrent constraints
- Higher-order narrowing with definitional trees
- Kernel-LEAF: A logic plus functional language
- Logic programming with functions and predicates: The language Babel
- Operational semantics for declarative multi-paradigm languages
- Run-Time Profiling of Functional Logic Programs
- Sequential abstract-state machines capture sequential algorithms
- The integration of functions into logic programming: From theory to practice
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The narrowing-driven approach to functional logic program specialization
Cited in
(25)- Rule-based operational semantics for an imperative language
- A framework for interpreting traces of functional logic computations
- A structural operational semantics for an Edison-like language
- Preserving Sharing in the Partial Evaluation of Lazy Functional Programs
- 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
- Rewriting and narrowing for constructor systems with call-time choice semantics
- From Boolean equalities to constraints
- Dynamic slicing of lazy functional programs based on redex trails
- scientific article; zbMATH DE number 1472273 (Why is no real title available?)
- Purely functional lazy nondeterministic programming
- Functional Logic Programming: From Theory to Curry
- Compiling a functional logic language: \textit{The Fair Scheme}
- An operational semantics for declarative multi-paradigm languages
- scientific article; zbMATH DE number 2087402 (Why is no real title available?)
- Singular and plural functions for functional logic programming
- Reporting failures in functional logic programs
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- Transforming Boolean equalities into constraints
- A structural operational semantics for an Edison like language. II
- A residualizing semantics for the partial evaluation of functional logic programs.
- On a Tighter Integration of Functional and Logic Programming
- Rewriting and Call-Time Choice: The HO Case
- Extra variables can be eliminated from functional logic programs
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)