On the public citation graph

The Lazy Lambda Calculus: an investigation into the foundations of functional programming

https://doi.org/10.48456/tr-263
0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/inco.1994.1003openalex-snapshot
Lambda-Calculi for (Strict) Parallel Functions
inferred← citeshttps://doi.org/10.1006/inco.1996.0037openalex-snapshot
The Discriminating Power of Multiplicities in theλ-Calculus
inferred← citeshttps://doi.org/10.1007/11417170_27openalex-snapshot
Continuity and Discontinuity in Lambda Calculus
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_59openalex-snapshot
The lazy call-by-value λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_44openalex-snapshot
Full abstraction and the Context Lemma (preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_98openalex-snapshot
Lazy Lambda calculus: Theories, models and local structure characterization
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_91openalex-snapshot
Extensions to type systems can preserve operational equivalences
inferred← citeshttps://doi.org/10.1007/3-540-61064-2_45openalex-snapshot
Full abstraction for lambda calculus with resources and convergence testing
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_68openalex-snapshot
Algebraic interpretation of lambda calculus with resources
inferred← citeshttps://doi.org/10.1007/3-540-61735-3_17openalex-snapshot
Meaningless terms in rewriting
inferred← citeshttps://doi.org/10.1007/3540539816_81openalex-snapshot
The evaluation transformer model of reduction and its correctness
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_24openalex-snapshot
Operational Theories of Improvement in Functional Languages
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_8openalex-snapshot
Computing Ready Simulations Efficiently
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_10openalex-snapshot
Effectful Normal Form Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_28openalex-snapshot
(Towards a) Statistical Probabilistic Lazy Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-57231-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-322-89207-2_15openalex-snapshot
Der λ-Kalkül als funktionale Programmiersprache
inferred← citeshttps://doi.org/10.1007/978-94-007-0954-6openalex-snapshot
Call-By-Push-Value
inferred← citeshttps://doi.org/10.1007/bf02946493openalex-snapshot
Reaction graph
inferred← citeshttps://doi.org/10.1007/bfb0014057openalex-snapshot
Final semantics for untyped λ-calculus
inferred← citeshttps://doi.org/10.1007/bfb0022248openalex-snapshot
Usability: formalising (un)definedness in typed lambda calculus
inferred← citeshttps://doi.org/10.1007/bfb0032031openalex-snapshot
A domain-theoretic model for a higher-order process calculus
inferred← citeshttps://doi.org/10.1007/s10990-006-0480-6openalex-snapshot
Call-by-push-value: Decomposing call-by-value and call-by-name
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00003-bopenalex-snapshot
Transformational design and implementation of a new efficient solution to the ready simulation problem
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00124-2openalex-snapshot
Partial map classifiers and partial cartesian closed categories
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00074-7openalex-snapshot
On reduction-based process semantics
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90064-oopenalex-snapshot
Can LCF be topped? Flat lattice models of typed λ-calculus
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50012-3openalex-snapshot
Functional Programming and Lambda Calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.018openalex-snapshot
Highlights in infinitary rewriting and lambda calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00353-4openalex-snapshot
Innocent game models of untyped λ-calculus
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00849-6openalex-snapshot
Adapting innocent game models for the Böhm tree λ-theory
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00047-9openalex-snapshot
A first order logic of effects
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00356-9openalex-snapshot
A fully abstract semantics for a higher-order functional language with nondeterministic computation
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00037-7openalex-snapshot
Variations on mobile processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00003-9openalex-snapshot
Termination, deadlock and divergence in the λ-calculus with multiplicities
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80016-1openalex-snapshot
A fully abstract semantics for a nondeterministic functional language with monadic types
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80083-5openalex-snapshot
Bisimulation in Untyped Lambda Calculus:
inferred← citeshttps://doi.org/10.1017/s0956796800001878openalex-snapshot
Representing demand by partial projections
inferred← citeshttps://doi.org/10.1017/s0956796897002724openalex-snapshot
The call-by-need lambda calculus
inferred← citeshttps://doi.org/10.1017/s0960129500000293openalex-snapshot
Fully abstract translations between functional languages
inferred← citeshttps://doi.org/10.1017/s0960129599002893openalex-snapshot
A semantics for lambda calculi with resources
inferred← citeshttps://doi.org/10.1093/logcom/5.4.495openalex-snapshot
A Naïve Time Analysis and its Theory of Cost Equivalence
inferred← citeshttps://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferred← citeshttps://doi.org/10.1109/lics.1989.39156openalex-snapshot
Computing with recursive types
inferred← citeshttps://doi.org/10.1109/lics.1990.113757openalex-snapshot
Completeness for typed lazy inequalities
inferred← citeshttps://doi.org/10.1109/lics.1992.185524openalex-snapshot
The lazy lambda calculus in a concurrency scenario
inferred← citeshttps://doi.org/10.1109/lics.1994.316084openalex-snapshot
A fully abstract semantics for concurrent graph reduction
inferred← citeshttps://doi.org/10.1109/lics.1995.523261openalex-snapshot
A fully abstract semantics for a concurrent functional language with monadic types
inferred← citeshttps://doi.org/10.1109/lics.1999.782594openalex-snapshot
Region analysis and the polymorphic lambda calculus
inferred← citeshttps://doi.org/10.1109/lics.2005.15openalex-snapshot
Eager Normal Form Bisimulation
inferred← citeshttps://doi.org/10.1109/lics.2007.17openalex-snapshot
Environmental Bisimulations for Higher-Order Languages
inferred← citeshttps://doi.org/10.1109/sfcs.1988.21953openalex-snapshot
Fully abstract models of the lazy lambda calculus
inferred← citeshttps://doi.org/10.1137/s0097539791224212openalex-snapshot
Full Abstraction and the Context Lemma
inferred← citeshttps://doi.org/10.1145/158511.158618openalex-snapshot
A natural semantics for lazy evaluation
inferred← citeshttps://doi.org/10.1145/158511.158627openalex-snapshot
Algebraic reasoning and completeness in typed languages
inferred← citeshttps://doi.org/10.1145/1889997.1890002openalex-snapshot
Environmental bisimulations for higher-order languages
inferred← citeshttps://doi.org/10.1145/199448.199450openalex-snapshot
Isolating side effects in sequential languages
inferred← citeshttps://doi.org/10.1145/3704848openalex-snapshot
The Duality of λ-Abstraction
inferred← citeshttps://doi.org/10.1145/99583.99617openalex-snapshot
Fully abstract translations between functional languages
inferred← citeshttps://doi.org/10.46298/lmcs-19(4:34)2023openalex-snapshot
Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
inferred← citeshttps://doi.org/10.48456/tr-730openalex-snapshot
Adaptive evaluation of non-strict programs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.