Multi-paradigm Declarative Languages

DOI10.1007/978-3-540-74610-2_5zbMath1213.68162OpenAlexW1512480360MaRDI QIDQ3608646

Michael Hanus

Publication date: 5 March 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74610-2_5

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (15)

Compiling a Functional Logic Language: The Fair Scheme ⋮ Relations as Executable Specifications: Taming Partiality and Non-determinism Using Invariants ⋮ Encoding abstract syntax without fresh names ⋮ An integrated framework for the diagnosis and correction of rule-based programs ⋮ A Relation Algebraic Semantics for a Lazy Functional Logic Language ⋮ Functional-Logic Graph Parser Combinators ⋮ Safe typing of functional logic programs with opaque patterns and local bindings ⋮ Transforming Functional Logic Programs into Monadic Functional Programs ⋮ Functional Logic Programming in Maude ⋮ Programming with narrowing: a tutorial ⋮ Termination of narrowing via termination of rewriting ⋮ A liberal type system for functional logic programs ⋮ A compact fixpoint semantics for term rewriting systems ⋮ Rewriting and Call-Time Choice: The HO Case ⋮ A Fully Abstract Semantics for Constructor Systems

This page was built for publication: Multi-paradigm Declarative Languages