Equality In Lazy Computation Systems

Equality In Lazy Computation Systems (1998)

by Douglas J. Howe

Citations:

92 - 6 self

218	The Lazy Lambda Calculus – Samson Abramsky - 1990
102	Functional programming and input/output – A D Gordon - 1994
1497	The Definition of Standard ML – Robin Milner, Mads Tofte, Robert Harper - 1990
599	Concurrency and automata on infinite sequences – D Park - 1981
109	Bisimilarity as a theory of functional programming – A Gordon - 1995
19	Operational Theories of Improvement in Functional Languages (Extended Abstract) – David Sands - 1991
106	On the Observable Properties of Higher Order Functions that Dynamically Create Local Names (preliminary report) – Andrew Pitts, Ian Stark - 1993
15	A fully abstract translation between a -calculus with reference types and Standard ML – E Ritter, A M Pitts - 1995
2972	Communication and Concurrency – R Milner - 1989
104	Fully Abstract Models of Typed Lambda Calculi, Th – R Milner - 1977
1224	Introduction to functional programming – Philip Wadler - 1995
17	On computational open-endedness in Martin-Löf’s type theory – Doug Howe - 1991
933	Bigraphs and Mobile Processes – Ole Høgh Jensen, Robin Milner - 2003
401	Computational Lambda-Calculus and Monads – Eugenio Moggi - 1988
363	LCF considered as a programming language – G D Plotkin - 1977
74	Co-induction in relational semantics – Robin Milner, Mads Tofte - 1991
533	A Transformation System for Developing Recursive Programs – R. M. Burstall, John Darlington - 1977
290	Functions as processes – R Milner - 1992
107	Calculli for Higher Order Communicating Systems – B Thomsen - 1990