Full abstraction and expressive completeness for FP

DOI10.1006/INCO.1995.1065zbMath0826.68029OpenAlexW2020246605MaRDI QIDQ1892888

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

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

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