Full abstraction and expressive completeness for FP

DOI10.1006/INCO.1995.1065MaRDI QIDQ1892888zbMATH OpenOpenAlexFDO

Authors Joseph Y. Halpern, Edward L. Wimmers

Publication date 10 July 1995

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7cfae17f7dbebf66170fb4578b1e4ceb4852c0a8

zbMATH Keywords

rewrite rules

Mathematics Subject Classification ID

Theory of programming languages (68N15) Formal languages and automata (68Q45)

Recommendations

• Full abstraction and limiting completeness in equational languages
• Full abstraction for expressiveness: history, myths and facts
• scientific article; zbMATH DE number 3976319
• scientific article; zbMATH DE number 431761
• Full abstraction, totality and PCF

Cited in

(7)

• Full abstraction and limiting completeness in equational languages
• Completeness of rewrite rules and rewrite strategies for FP
• Full abstraction, totality and PCF
• Full Abstraction and the Context Lemma
• Full abstraction and the Context Lemma (preliminary report)
• On abstraction and the expressive power of programming languages
• Full abstraction for expressiveness: history, myths and facts

This page was built for publication: Full abstraction and expressive completeness for FP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892888)