A Fully Abstract Semantics for Constructor Systems

DOI10.1007/978-3-642-02348-4_23zbMath1242.68137OpenAlexW1536212484MaRDI QIDQ3636832

Francisco J. López Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández

Publication date: 30 June 2009

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02348-4_23

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Transforming Functional Logic Programs into Monadic Functional Programs ⋮ An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry

Uses Software

• Maude

Cites Work

• There is no fully abstract fixpoint semantics for non-deterministic languages with infinite computations
• LCF considered as a programming language
• Rewriting logic: Roadmap and bibliography
• Improving the Efficiency of Non-Deterministic Computations1 1Supported in part by NSF grants INT-9981317 and CCR-0110496 and by the Spanish Knowledge Society Foundation, the Spanish Research Funding Agency (CICYT) TIC 2001-2705-C03-01, by Acción Integrade Hispano-Italiana HI2000-0161, and the Valencian Research Council under grant GV01-424.
• Abstract Diagnosis of Functional Programs
• On a Tighter Integration of Functional and Logic Programming
• Multi-paradigm Declarative Languages
• An approach to declarative programming based on a rewriting logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Fully Abstract Semantics for Constructor Systems