Principals in programming languages, a syntactic proof technique

DOI10.1145/317636.317799MaRDI QIDQ2817722zbMATH OpenOpenAlexFDO

Authors Steve Zdancewic, Dan Grossman, Greg Morrisett

Publication date 1 September 2016

Published in Proceedings of the fourth ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/317636.317799

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Programming Languages and Systems
• scientific article; zbMATH DE number 1844568
• Authentication primitives and their compilation
• Synthesis of Data Views for Communicating Processes
• scientific article; zbMATH DE number 1330433

Cited in

(3)

• scientific article; zbMATH DE number 1844568 (Why is no real title available?)
• Dynamic translucency with abstraction kinds and higher-order coercions
• A bisimulation for dynamic sealing

This page was built for publication: Principals in programming languages, a syntactic proof technique

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