On the public citation graph

The | lambda-Calculus.

https://doi.org/10.2307/2185110
0 signed · 476 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.3217/jucs-007-11-1068openalex-extracted
Compiling Abstract State Machines to C++
inferred← citeshttps://doi.org/10.1006/inco.1994.1003openalex-snapshot
Lambda-Calculi for (Strict) Parallel Functions
inferred← citeshttps://doi.org/10.1006/inco.1994.1052openalex-snapshot
A Fully Abstract Denotational Model for Higher-Order Processes
inferred← citeshttps://doi.org/10.1006/inco.1995.1057openalex-snapshot
Parallel Reductions in λ-Calculus
inferred← citeshttps://doi.org/10.1006/inco.1995.1075openalex-snapshot
Transfinite Reductions in Orthogonal Term Rewriting Systems
inferred← citeshttps://doi.org/10.1006/inco.1996.0035openalex-snapshot
On a Question of H. Friedman
inferred← citeshttps://doi.org/10.1006/inco.1996.0037openalex-snapshot
The Discriminating Power of Multiplicities in theλ-Calculus
inferred← citeshttps://doi.org/10.1006/inco.1996.0052openalex-snapshot
Relational Properties of Domains
inferred← citeshttps://doi.org/10.1006/inco.1998.2729openalex-snapshot
A Conservative Look at Operational Semantics with Variable Binding
inferred← citeshttps://doi.org/10.1006/inco.2000.2917openalex-snapshot
On Full Abstraction for PCF: I, II, and III
inferred← citeshttps://doi.org/10.1007/1-4020-8159-6_4openalex-snapshot
Formal Reasoning About Systems, Software and Hardware
inferred← citeshttps://doi.org/10.1007/10703163_18openalex-snapshot
Normalization of Typable Terms by Superdevelopments
inferred← citeshttps://doi.org/10.1007/10703163_21openalex-snapshot
Morphisms and Partitions of V-sets
inferred← citeshttps://doi.org/10.1007/10721975_14openalex-snapshot
On the Word Problem for Combinators
inferred← citeshttps://doi.org/10.1007/11541868_2openalex-snapshot
Alpha-Structural Recursion and Induction
inferred← citeshttps://doi.org/10.1007/11541868_4openalex-snapshot
Mechanized Metatheory for the Masses: The PoplMark Challenge
inferred← citeshttps://doi.org/10.1007/11554554_6openalex-snapshot
On the Dynamic Increase of Multiplicities in Matrix Proof Methods for Classical Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/11559306_1openalex-snapshot
A Comprehensive Framework for Combined Decision Procedures
inferred← citeshttps://doi.org/10.1007/11560586_32openalex-snapshot
Two Variables Are Not Enough
inferred← citeshttps://doi.org/10.1007/11601548_7openalex-snapshot
Sharing in the Weak Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_162openalex-snapshot
Modelling of cooperative processes
inferred← citeshttps://doi.org/10.1007/3-540-19027-9_10openalex-snapshot
Programming with proofs: A second order type theory
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_24openalex-snapshot
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
inferred← citeshttps://doi.org/10.1007/3-540-36280-0_19openalex-snapshot
Calculating Church-Rosser Proofs in Kleene Algebra
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_19openalex-snapshot
Demonstrating Lambda Calculus Reduction
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_7openalex-snapshot
Genericity and the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-44622-2_32openalex-snapshot
On the Computational Interpretation of Negation
inferred← citeshttps://doi.org/10.1007/3-540-44716-4_23openalex-snapshot
A simply typed context calculus with first-class environments
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_28openalex-snapshot
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_8openalex-snapshot
Diagrams for Meaning Preservation
inferred← citeshttps://doi.org/10.1007/3-540-44904-3_5openalex-snapshot
On Strong Normalization in the Intersection Type Discipline
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_11openalex-snapshot
Uniform Normalisation beyond Orthogonality
inferred← citeshttps://doi.org/10.1007/3-540-45263-x_13openalex-snapshot
MobileML: A Programming Language for Mobile Computation
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_17openalex-snapshot
A Calculus for Link-Time Compilation
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_27openalex-snapshot
Equational Reasoning for Linking with First-Class Primitive Modules
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_9openalex-snapshot
A Calculus for Compiling and Linking Classes
inferred← citeshttps://doi.org/10.1007/3-540-46428-x_12openalex-snapshot
What Is ‘Mathematicalness’ in Software Engineering?
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_14openalex-snapshot
Explicit Substitutions and Programming Languages
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_33openalex-snapshot
A P-Time Completeness Proof for Light Logics
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_6openalex-snapshot
A Survey of Automated Deduction
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_35openalex-snapshot
A confluence result for a typed λ-calculus of exception handling with fixed-point
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_5openalex-snapshot
Normalisation in Weakly Orthogonal Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-48959-2_25openalex-snapshot
Consequences of Jacopini’s Theorem: Consistent Equalities and Equations
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_36openalex-snapshot
On type inference for object-oriented programming languages
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_130openalex-snapshot
Towards a lambda-calculus for concurrent and communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_50openalex-snapshot
On the syntax of infinite objects: an extension of Martin-Löf's theory of expressions
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_51openalex-snapshot
β-Reductions and β-developments of λ-terms with the least number of steps
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_37openalex-snapshot
Characterizing complexity classes by higher type
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_120openalex-snapshot
Open problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_81openalex-snapshot
Transfinite reductions in orthogonal term rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_59openalex-snapshot
Time analysis, cost equivalence and program refinement
inferred← citeshttps://doi.org/10.1007/3-540-55511-0_4openalex-snapshot
A simple language supporting angelic nondeterminism and parallel composition
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_4openalex-snapshot
Simple type inference for term graph rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_84openalex-snapshot
Optimal reductions in interaction systems
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_7openalex-snapshot
A self-interpreter of lambda calculus having a normal form
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_52openalex-snapshot
Constant time reductions in λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_14openalex-snapshot
Compilation of head and strong reduction
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_29openalex-snapshot
A tiny constraint functional logic language and its continuation semantics
inferred← citeshttps://doi.org/10.1007/3-540-58025-5_48openalex-snapshot
Birkhoff's HSP-theorem for cumulative logic programs
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_14openalex-snapshot
A chemical abstract machine for graph reduction extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_15openalex-snapshot
Strong normalization in a non-deterministic typed lambda-calculus
inferred← citeshttps://doi.org/10.1007/3-540-58216-9_34openalex-snapshot
Higher-order rigid E-unification
inferred← citeshttps://doi.org/10.1007/3-540-58233-9_14openalex-snapshot
Termination proofs for higher-order rewrite systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_114openalex-snapshot
Inductive definitions and type theory an introduction (preliminary version)
inferred← citeshttps://doi.org/10.1007/3-540-60360-3_41openalex-snapshot
Effective flow analysis for avoiding run-time checks
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/3-540-61052-9_43openalex-snapshot
Introducing a calculus for higher-order multiset programming
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-61780-9_75openalex-snapshot
Optimized encodings of fragments of type theory in first order logic
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_79openalex-snapshot
Effective reduction and conversion strategies for combinators
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_80openalex-snapshot
Finite family developments
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_52openalex-snapshot
A type-free resource-aware λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_55openalex-snapshot
On Cartesian monoids
inferred← citeshttps://doi.org/10.1007/3540543961_14openalex-snapshot
What is an efficient implementation of the λ-calculus?
inferred← citeshttps://doi.org/10.1007/3540543961_8openalex-snapshot
A strongly-typed self-applicable partial evaluator
inferred← citeshttps://doi.org/10.1007/978-0-387-35663-1_2openalex-snapshot
Informatics — The Science of Minimal Systems with Maximal Complexity
inferred← citeshttps://doi.org/10.1007/978-0-8176-4769-8_10openalex-snapshot
The Unintended Interpretations of Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-1-4020-2653-9openalex-snapshot
Automated Model Building
inferred← citeshttps://doi.org/10.1007/978-1-4471-0097-3_3openalex-snapshot
Transforming Rapid Prototypes to Efficient Parallel Programs
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_11openalex-snapshot
Sequentiality by Linear Implication and Universal Quantification
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_11openalex-snapshot
Dimension-Complemented Lambda Abstraction Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferred← citeshttps://doi.org/10.1007/978-1-4612-4268-0_1openalex-snapshot
Historical and Philosophical Background
inferred← citeshttps://doi.org/10.1007/978-1-4612-4268-0_3openalex-snapshot
Aspects of Universal Algebra in Combinatory Logic
inferred← citeshttps://doi.org/10.1007/978-1-4612-4268-0_4openalex-snapshot
Remarks on an Algebraic Theory of Recursive Degrees
inferred← citeshttps://doi.org/10.1007/978-1-4613-0609-2_28openalex-snapshot
Least Fixed Points in Preassociative Combinatory Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4613-1007-5_31openalex-snapshot
Algorithmic Information of Images
inferred← citeshttps://doi.org/10.1007/978-3-030-14805-8_2openalex-snapshot
Cactus Environment Machine
inferred← citeshttps://doi.org/10.1007/978-3-030-29007-8_3openalex-snapshot
A Neurally-Guided, Parallel Theorem Prover
inferred← citeshttps://doi.org/10.1007/978-3-030-41103-9_3openalex-snapshot
A Type Theory for Probabilistic $$\lambda $$–calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_30openalex-snapshot
Spinal Atomic Lambda-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-50273-7_4openalex-snapshot
Towards the (Cognitive) Reality of Mathematics and the Mathematics of (Cognitive) Reality
inferred← citeshttps://doi.org/10.1007/978-3-319-08918-8_28openalex-snapshot
Near Semi-rings and Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-11041-7_7openalex-snapshot
Cut Elimination, Substitution and Normalisation
inferred← citeshttps://doi.org/10.1007/978-3-319-11629-7_3openalex-snapshot
Incorporating First-Order Unification into Functional Language via First-Class Environments
inferred← citeshttps://doi.org/10.1007/978-3-319-22686-6_3openalex-snapshot
Kreisel’s Theory of Constructions, the Kreisel-Goodman Paradox, and the Second Clause
inferred← citeshttps://doi.org/10.1007/978-3-319-27683-0_27openalex-snapshot
Levy Labels and Recursive Types
inferred← citeshttps://doi.org/10.1007/978-3-319-30936-1_11openalex-snapshot
The Lambda Calculus: Practice and Principle
inferred← citeshttps://doi.org/10.1007/978-3-319-66107-0_16openalex-snapshot
A Formalized General Theory of Syntax with Bindings
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_5openalex-snapshot
A Probabilistic Semantics for the Pure $$\lambda $$ -Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-68732-2_6openalex-snapshot
Some Tweets About Mockingbirds
inferred← citeshttps://doi.org/10.1007/978-3-319-68953-1_7openalex-snapshot
A Decidable Subtyping Logic for Intersection and Union Types
inferred← citeshttps://doi.org/10.1007/978-3-319-72056-2_20openalex-snapshot
The Completeness of BCD for an Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-24640-4_11openalex-snapshot
References and Index
inferred← citeshttps://doi.org/10.1007/978-3-540-24756-2_24openalex-snapshot
Integrating Formal Methods by Unifying Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_89openalex-snapshot
Extensional Theories and Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_21openalex-snapshot
A Functional Language for Logarithmic Space
inferred← citeshttps://doi.org/10.1007/978-3-540-31987-0_16openalex-snapshot
Bottom-Up β-Reduction: Uplinks and λ-DAGs
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_10openalex-snapshot
Decidable Variants of Higher-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-44616-3_8openalex-snapshot
Subsorted Partial Higher-Order Logic as an Extension of CASL
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_12openalex-snapshot
On Normalization by Evaluation for Object Calculi
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_27openalex-snapshot
A System F with Call-by-Name Exceptions
inferred← citeshttps://doi.org/10.1007/978-3-540-70592-5_2openalex-snapshot
A Model for Java with Wildcards
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_14openalex-snapshot
The Omega Rule is $\mathbf{\Pi_{1}^{1}}$ -Complete in the λβ-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_8openalex-snapshot
An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_25openalex-snapshot
Correctness of Copy in Calculi with Letrec
inferred← citeshttps://doi.org/10.1007/978-3-540-73554-0_15openalex-snapshot
Taming Non-compositionality Using New Binders
inferred← citeshttps://doi.org/10.1007/978-3-540-73589-2_2openalex-snapshot
Gradual Typing for Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-74464-1_15openalex-snapshot
Using Intersection Types for Cost-Analysis of Higher-Order Polymorphic Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-01748-3_1openalex-snapshot
Modular Verification of Recursive Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-03429-9_19openalex-snapshot
Term-Generic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_16openalex-snapshot
ASMs and Operational Algorithmic Completeness of Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_24openalex-snapshot
Towards a Canonical Classical Natural Deduction System
inferred← citeshttps://doi.org/10.1007/978-3-642-15205-4_40openalex-snapshot
Coq Modulo Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_18openalex-snapshot
Concurrent Pattern Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-20920-8_24openalex-snapshot
On Polymorphic Types of Untyped Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-22438-6_3openalex-snapshot
Translating between Language and Logic: What Is Easy and What Is Difficult
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_21openalex-snapshot
Full Abstraction for Set-Based Models of the Symmetric Interaction Combinators
inferred← citeshttps://doi.org/10.1007/978-3-642-29822-6_4openalex-snapshot
Call-by-Value Solvability, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-31365-3_36openalex-snapshot
Correctness of Program Transformations as a Termination Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-39053-1_16openalex-snapshot
On λ-Definable Functions on Ordinals
inferred← citeshttps://doi.org/10.1007/978-3-642-40355-2_8openalex-snapshot
Clocks for Functional Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-58622-4_2openalex-snapshot
Notes on the Simply Typed Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-662-02952-7_10openalex-snapshot
The Use of Domain Information and Higher Order Logic for Model Management
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-05679-0_9openalex-snapshot
Combinatory Logic, Language, and Cognitive Representations
inferred← citeshttps://doi.org/10.1007/978-88-470-0784-0_2openalex-snapshot
On Formal Proofs
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_18openalex-snapshot
First-Order Constrained Lambda Calculus
inferred← citeshttps://doi.org/10.1007/978-94-009-1337-0_16openalex-snapshot
Compositional Semantics for LFG
inferred← citeshttps://doi.org/10.1007/978-94-009-7066-3_4openalex-snapshot
Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_5openalex-snapshot
Working Foundations - ’ 91
inferred← citeshttps://doi.org/10.1007/978-94-011-2779-0_8openalex-snapshot
Complementarity in Language; Toward a General Understanding
inferred← citeshttps://doi.org/10.1007/978-94-015-6878-4_15openalex-snapshot
Combinators and Grammars
inferred← citeshttps://doi.org/10.1007/978-94-017-0435-9_3openalex-snapshot
Interactive and Automated Proof Construction in Type Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0460-1_3openalex-snapshot
Combinators, Proofs and Implicational Logics
inferred← citeshttps://doi.org/10.1007/bf00244393openalex-snapshot
Mechanical procedure for proof construction via closed terms in typed ? calculus
inferred← citeshttps://doi.org/10.1007/bf00263539openalex-snapshot
Categorial grammar and type theory
inferred← citeshttps://doi.org/10.1007/bf00881715openalex-snapshot
OTTER experiments in a system of combinatory logic
inferred← citeshttps://doi.org/10.1007/bf01229961openalex-snapshot
Representation of varieties in combinatory algebras
inferred← citeshttps://doi.org/10.1007/bf01387763openalex-snapshot
A semantical proof of De Jongh's theorem
inferred← citeshttps://doi.org/10.1007/bf01620763openalex-snapshot
Equivalence of bar recursors in the theory of functionals of finite type
inferred← citeshttps://doi.org/10.1007/bf01792986openalex-snapshot
Opérateurs de mise en mémoire et traduction de Gödel
inferred← citeshttps://doi.org/10.1007/bf01807698openalex-snapshot
Conjunction-type standard ML polymorphism
inferred← citeshttps://doi.org/10.1007/bf02471142openalex-snapshot
Symbolic chemical system based on abstract rewriting system and its behavior pattern
inferred← citeshttps://doi.org/10.1007/bf02665950openalex-snapshot
The development of a partial evaluator for extended lambda calculus
inferred← citeshttps://doi.org/10.1007/bf02674638openalex-snapshot
On finitely-related and free algebras of cantor varieties
inferred← citeshttps://doi.org/10.1007/bf03036472openalex-snapshot
Calculi for interaction
inferred← citeshttps://doi.org/10.1007/bfb0000486openalex-snapshot
The update calculus
inferred← citeshttps://doi.org/10.1007/bfb0013072openalex-snapshot
General model theoretic semantics for Higher-Order horn logic programming
inferred← citeshttps://doi.org/10.1007/bfb0014043openalex-snapshot
A model for formal parametric polymorphism: A per interpretation for system R
inferred← citeshttps://doi.org/10.1007/bfb0014545openalex-snapshot
Strong normalisation in higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0018353openalex-snapshot
On the semantics of second order lambda calculus: From bruce-meyer-mitchell models to hyperdoctrine models and vice-versa
inferred← citeshttps://doi.org/10.1007/bfb0019355openalex-snapshot
Using resolution for deciding solvable classes and building finite models
inferred← citeshttps://doi.org/10.1007/bfb0022278openalex-snapshot
General form recursive equations I
inferred← citeshttps://doi.org/10.1007/bfb0022547openalex-snapshot
The mathematics of set predicates in Prolog
inferred← citeshttps://doi.org/10.1007/bfb0022575openalex-snapshot
Classical proofs as programs
inferred← citeshttps://doi.org/10.1007/bfb0023867openalex-snapshot
Denotations for classical proofs -Preliminary results-
inferred← citeshttps://doi.org/10.1007/bfb0026099openalex-snapshot
Implementing term rewrite languages in Dactl
inferred← citeshttps://doi.org/10.1007/bfb0026297openalex-snapshot
Characterizing complexity classes by general recursive definitions in higher types
inferred← citeshttps://doi.org/10.1007/bfb0027402openalex-snapshot
Three faces of natural deduction
inferred← citeshttps://doi.org/10.1007/bfb0029640openalex-snapshot
Internal labellings in lambda-calculus
inferred← citeshttps://doi.org/10.1007/bfb0031928openalex-snapshot
Formulas-as-types for a hierarchy of sublogics of intuitionistic propositional logic
inferred← citeshttps://doi.org/10.1007/bfb0032393openalex-snapshot
A functional system with transfinitely defined types
inferred← citeshttps://doi.org/10.1007/bfb0032397openalex-snapshot
A simple proof of the genericity lemma
inferred← citeshttps://doi.org/10.1007/bfb0035755openalex-snapshot
Subduing self-application
inferred← citeshttps://doi.org/10.1007/bfb0037106openalex-snapshot
Modified realizability toposes and strong normalization proofs
inferred← citeshttps://doi.org/10.1007/bfb0037107openalex-snapshot
Semantics of lambda-I and of other substructure lambda calculi
inferred← citeshttps://doi.org/10.1007/bfb0043090openalex-snapshot
On the λ-definable tree operations
inferred← citeshttps://doi.org/10.1007/bfb0049335openalex-snapshot
Higher-order action calculi
inferred← citeshttps://doi.org/10.1007/bfb0052377openalex-snapshot
Higher-order rewriting and partial evaluation
inferred← citeshttps://doi.org/10.1007/bfb0053046openalex-snapshot
A reflective model of inheritance
inferred← citeshttps://doi.org/10.1007/bfb0054248openalex-snapshot
Extensional higher-order resolution
inferred← citeshttps://doi.org/10.1007/bfb0055140openalex-snapshot
Hot: A concurrent automated theorem prover based on higher-order tableaux
inferred← citeshttps://doi.org/10.1007/bfb0093926openalex-snapshot
A guide to polymorphic types
inferred← citeshttps://doi.org/10.1007/bfb0105418openalex-snapshot
Higher-order annotated terms for proof search
inferred← citeshttps://doi.org/10.1007/s00153-022-00856-0openalex-snapshot
Towards a homotopy domain theory
inferred← citeshttps://doi.org/10.1007/s001650200017openalex-snapshot
Three Inadequate Models
inferred← citeshttps://doi.org/10.1007/s001700170103openalex-snapshot
A Hybrid Specification Method for the Design of a Workcell Controller in Manufacturing Systems
inferred← citeshttps://doi.org/10.1007/s00236-005-0175-1openalex-snapshot
Genericity and the π-calculus
inferred← citeshttps://doi.org/10.1007/s10559-008-0015-8openalex-snapshot
Existential foundations of the composition paradigm
inferred← citeshttps://doi.org/10.1007/s10559-014-9641-5openalex-snapshot
New Proofs of Important Theorems of Untyped Extensional λ Calculus
inferred← citeshttps://doi.org/10.1007/s10817-012-9253-6openalex-snapshot
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions
inferred← citeshttps://doi.org/10.1007/s10817-019-09522-2openalex-snapshot
A Formalized General Theory of Syntax with Bindings: Extended Version
inferred← citeshttps://doi.org/10.1007/s10990-007-9015-zopenalex-snapshot
Strongly reducing variants of the Krivine abstract machine
inferred← citeshttps://doi.org/10.1007/s40687-018-0163-zopenalex-snapshot
A game-semantic model of computation
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00027-xopenalex-snapshot
A typed resolution principle for deduction with conditional typing theory
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90029-8openalex-snapshot
On the implementation of abstract data types by programming language constructs
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90054-jopenalex-snapshot
Constructive λ-models
inferred← citeshttps://doi.org/10.1016/0165-0114(90)90020-7openalex-snapshot
Fuzzy topology with respect to continuous lattices
showing the first 200 of 476 · page through all 476
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.