A Fully Abstract Semantics for Constructor Systems
From MaRDI portal
Recommendations
Cites work
- Abstract diagnosis of functional programs
- An approach to declarative programming based on a rewriting logic
- An evaluation semantics for narrowing-based functional logic languages
- scientific article; zbMATH DE number 1729952 (Why is no real title available?)
- scientific article; zbMATH DE number 3763271 (Why is no real title available?)
- scientific article; zbMATH DE number 512906 (Why is no real title available?)
- scientific article; zbMATH DE number 1088020 (Why is no real title available?)
- scientific article; zbMATH DE number 234027 (Why is no real title available?)
- Improving the efficiency of non-deterministic computations
- LCF considered as a programming language
- Multi-paradigm Declarative Languages
- On a Tighter Integration of Functional and Logic Programming
- Rewriting logic: Roadmap and bibliography
- There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
Cited in
(5)- A mechanized semantics for C++ object construction and destruction, with applications to resource management
- Transforming functional logic programs into monadic functional programs
- An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry
- Completeness of combinations of constructor systems
- A compact fixpoint semantics for term rewriting systems
This page was built for publication: A Fully Abstract Semantics for Constructor Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3636832)