|
7
|
FUNDIO: A Lambda-Calculus with a letrec, case, Constructors, and an IO-Interface: Approaching a Theory of unsafePerformIO
– Manfred Schmidt-Schauß
- 2003
|
|
31
|
Improvement in a Lazy Context: An Operational Theory for Call-By-Need
– Andrew Moran, David Sands
- 1999
|
|
5
|
Possibilities and limitations of call-by-need space improvement
– Jörgen Gustavsson
- 2001
|
|
18
|
A Foundation for Space-Safe Transformations of Call-by-Need Programs
– Jörgen Gustavsson , David Sands
- 1999
|
|
22
|
Algebraic Approaches to Nondeterminism - an Overview
– Michal Walicki, Sigurd Meldal
- 1997
|
|
8
|
Making Choices Lazily
– John Hughes, Andrew Moran
- 1995
|
|
6
|
Unique Fixed Point Induction for McCarthy's Amb
– Søren Lassen, Andrew Moran
- 1999
|
|
|
Towards a Scalable Update Avoidance Analysis
– Jörgen Gustavsson, Josef Svenningsson
- 2000
|
|
11
|
A Usage Analysis With Bounded Usage Polymorphism and Subtyping
– Jörgen Gustavsson, Josef Svenningsson
- 2000
|
|
33
|
Once Upon a Polymorphic Type
– Keith Wansbrough, Simon Peyton Jones
- 1998
|
|
2
|
Natural Semantics for Non-Determinism
– Andrew Moran
- 1993
|
|
|
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles
– Seyed H. Haeri (Hossein)
- 2009
|
|
1
|
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles
– Seyed H. Haeri
- 2009
|
|
1
|
A Theory of Core Fudgets
– Colin J. Taylor
- 1998
|
|
23
|
Concatenate, Reverse and Map Vanish For Free
– Janis Voigtländer
- 2002
|
|
2
|
Formalising and Reasoning about Fudgets
– Colin J. Taylor
- 1998
|
|
2
|
Two Non-Determinism Analyses in Eden
– Ricardo Peña, Clara Segura
- 2000
|
|
5
|
Three Non-determinism Analyses in a Parallel-Functional Language
– Ricardo Peña, Clara Segura
- 2001
|
|
33
|
Operational Properties of Lily, a Polymorphic Linear Lambda Calculus with Recursion
– G.M. Bierman, A. M. Pitts, C. V. Russo
|
