scientific article

zbMATH Open0765.68143MaRDI QIDQ4038678

Jon G. Riecke

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

zbMATH Keywords

functional languagesprogramming language for computable functionscall-by-value observational congruences

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Extended call-by-push-value: reasoning about effectful programs and evaluation order ⋮ A formal equational theory for call-by-push-value ⋮ An abstract machine for strong call by value ⋮ System \(T\), call-by-value and the minimum problem

Uses Software

• LISP

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A language-independent proof system for full program equivalence 👍 👎
• Proof nets and the call-by-value \(\lambda\)-calculus 👍 👎
• A formal equational theory for call-by-push-value 👍 👎
• Call-by-Value Solvability, Revisited 👍 👎
• Sound and complete axiomatisations of call-by-value control operators 👍 👎
• A Semantical and Operational Account of Call-by-Value Solvability 👍 👎

This page was built for publication:

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