Can LCF be topped ? Flat lattice models of typed &lgr;-calculus

Authors:
Bard Bloom
Affiliations:
-
Venue:
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Year:
1990

Fully abstract translations between functional languages

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From SOS rules to proof principles: an operational metatheory for functional languages

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A stable programming language

Information and Computation
A stable programming language

Information and Computation

Hi-index	0.00