On the public citation graph
The theory of call-by-value solvability
0 signed · 82 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19800261902openalex-snapshot
Lambda‐Calculus Models and Extensionality
inferredcites →https://doi.org/10.1006/jcss.2000.1703openalex-snapshot
Full Intersection Types and Topologies in Lambda Calculus
inferredcites →https://doi.org/10.1007/3-540-45446-2_5openalex-snapshot
Call-by-Value Separability and Computability
inferredcites →https://doi.org/10.1007/3-540-57887-0_115openalex-snapshot
Discovering needed reductions using type theory
inferredcites →https://doi.org/10.1007/3-540-61735-3_17openalex-snapshot
Meaningless terms in rewriting
inferredcites →https://doi.org/10.1007/978-3-030-59025-3_2openalex-snapshot
The Bang Calculus Revisited
inferredcites →https://doi.org/10.1007/978-3-030-71995-1_18openalex-snapshot
The Spirit of Node Replication
inferredcites →https://doi.org/10.1007/978-3-642-02273-9_12openalex-snapshot
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form
inferredcites →https://doi.org/10.1007/978-3-642-29822-6_4openalex-snapshot
Call-by-Value Solvability, Revisited
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_7openalex-snapshot
A Semantical and Operational Account of Call-by-Value Solvability
inferredcites →https://doi.org/10.1007/978-3-662-10394-4openalex-snapshot
The Parametric Lambda Calculus
inferredcites →https://doi.org/10.1007/bf01019462openalex-snapshot
Reasoning about programs in continuation-passing style
inferredcites →https://doi.org/10.1007/bfb0032397openalex-snapshot
A simple proof of the genericity lemma
inferredcites →https://doi.org/10.1016/0022-0000(92)90040-popenalex-snapshot
An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
inferredcites →https://doi.org/10.1016/0168-0072(83)90030-1openalex-snapshot
Set-theoretical models of λ-calculus: theories, expansions, isomorphisms
inferredcites →https://doi.org/10.1016/0168-0072(88)90025-5openalex-snapshot
Normal functors, power series and λ-calculus
inferredcites →https://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferredcites →https://doi.org/10.1016/0304-3975(75)90017-1openalex-snapshot
Call-by-name, call-by-value and the λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(93)90094-aopenalex-snapshot
Set-theoretical and other elementary models of the λ-calculus
inferredcites →https://doi.org/10.1016/0890-5401(87)90042-3openalex-snapshot
Type theories, normal forms, and D∞-lambda-models
inferredcites →https://doi.org/10.1016/j.ic.2015.12.010openalex-snapshot
A semantic account of strong normalization in linear logic
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.017openalex-snapshot
A semantic measure of the execution time in linear logic
inferredcites →https://doi.org/10.1016/j.tcs.2015.08.006openalex-snapshot
Proof nets and the call-by-value λ-calculus
inferredcites →https://doi.org/10.1016/s0168-0072(00)00056-7openalex-snapshot
On phase semantics and denotational semantics: the exponentials
inferredcites →https://doi.org/10.1016/s0304-3975(98)00358-2openalex-snapshot
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
inferredcites →https://doi.org/10.1016/s0890-5401(03)00088-9openalex-snapshot
Modelling environments in call-by-value programming languages
inferredcites →https://doi.org/10.1017/s0960129516000396openalex-snapshot
Execution time of λ-terms via denotational semantics and intersection types
inferredcites →https://doi.org/10.1017/s0960129598002722openalex-snapshot
The call-by-value λ-calculus: a semantic investigation
inferredcites →https://doi.org/10.1093/jigpal/jzx018openalex-snapshot
Non-idempotent intersection types for the Lambda-Calculus
inferredcites →https://doi.org/10.1093/logcom/10.3.411openalex-snapshot
A linearization of the Lambda-calculus and consequences
inferredcites →https://doi.org/10.1093/logcom/exm037openalex-snapshot
Call-by-Value -calculus and LJQ
inferredcites →https://doi.org/10.1109/lics.1989.39155openalex-snapshot
Computational lambda-calculus and monads
inferredcites →https://doi.org/10.1109/lics.2015.23openalex-snapshot
On the Relative Usefulness of Fireballs
inferredcites →https://doi.org/10.1109/lics52264.2021.9470630openalex-snapshot
Strong Call-by-Value is Reasonable, Implosively
inferredcites →https://doi.org/10.1109/lics52264.2021.9470726openalex-snapshot
The Space of Interaction
inferredcites →https://doi.org/10.1137/0205036openalex-snapshot
The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
inferredcites →https://doi.org/10.1145/1016850.1016871openalex-snapshot
Types, potency, and idempotency
inferredcites →https://doi.org/10.1145/3158094openalex-snapshot
Polyadic approximations, fibrations and intersection types
inferredcites →https://doi.org/10.1145/3373718.3394774openalex-snapshot
Consuming and Persistent Types for Classical Logic
inferredcites →https://doi.org/10.1145/3434313openalex-snapshot
Intersection types and (positive) almost-sure termination
inferredcites →https://doi.org/10.1145/581478.581501openalex-snapshot
A compiled implementation of strong reduction
inferredcites →https://doi.org/10.1305/ndjfl/1093883253openalex-snapshot
An extension of the basic functionality theory for the $\lambda$-calculus.
inferredcites →https://doi.org/10.2168/lmcs-12(2:12)2016openalex-snapshot
No solvable lambda-value term left behind
inferredcites →https://doi.org/10.2168/lmcs-9(4:3)2013openalex-snapshot
Non-idempotent intersection types and strong normalisation
inferredcites →https://doi.org/10.2307/2273659openalex-snapshot
A filter lambda model and the completeness of type assignment
inferredcites →https://doi.org/10.23638/lmcs-13(4:29)2017openalex-snapshot
Standardization and Conservativity of a Refined Call-by-Value lambda-Calculus
inferredcites →https://doi.org/10.23638/lmcs-17(1:7)2021openalex-snapshot
Solvability = Typability + Inhabitation
inferredcites →https://doi.org/10.3233/fi-2019-1862openalex-snapshot
New Semantical Insights Into Call-by-Value λ-Calculus
inferredcites →https://doi.org/10.4204/eptcs.293.5openalex-snapshot
Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus
inferredcites →https://doi.org/10.4230/lipics.csl.2012.259openalex-snapshot
Collapsing non-idempotent intersection types
inferredcites →https://doi.org/10.4230/lipics.csl.2020.35openalex-snapshot
The Call-By-Value Lambda-Calculus with Generalized Applications
inferredcites →https://doi.org/10.4230/lipics.csl.2022.27openalex-snapshot
Encoding Tight Typing in a Unified Framework
inferredcites →https://doi.org/10.4230/lipics.rta.2012.22openalex-snapshot
On the Invariance of the Unitary Cost Model for Head Reduction
inferredcites →https://doi.org/10.4230/lipics.tlca.2015.211openalex-snapshot
Standardization of a Call-By-Value Lambda-Calculus
inferredcites →https://doi.org/10.4230/lipics.types.2019.3openalex-snapshot
A Quantitative Understanding of Pattern Matching
inferredcites →https://doi.org/10.4230/oasics.wpte.2015.3openalex-snapshot
Head reduction and normalization in a call-by-value lambda-calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-39784-4_4openalex-snapshot
Quantitative Global Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-47963-2_13openalex-snapshot
Strong Call-by-Value and Multi Types
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-031-63501-4_18openalex-snapshot
The Benefits of Diligence
inferred← citeshttps://doi.org/10.1007/978-3-031-91118-7_1openalex-snapshot
The Vanilla Sequent Calculus is Call-by-Value
inferred← citeshttps://doi.org/10.1017/s0960129525100285openalex-snapshot
A quantitative approach to global state composition
inferred← citeshttps://doi.org/10.1145/3571244openalex-snapshot
Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework
inferred← citeshttps://doi.org/10.1145/3622758openalex-snapshot
Proceedings of the 2023 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software
inferred← citeshttps://doi.org/10.1145/3622758.3622884openalex-snapshot
Sharing a Perspective on the 𝜆-Calculus
inferred← citeshttps://doi.org/10.1145/3661814.3662113openalex-snapshot
Genericity Through Stratification
inferred← citeshttps://doi.org/10.46298/lmcs-20(4:24)2024openalex-snapshot
Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space
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.