On the public citation graph

A new type assignment for λ-terms

https://doi.org/10.1007/bf02011875

0 signed · 150 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0029521openalex-snapshot

λ-Terms as total or partial functions on normal forms

inferredcites →https://doi.org/10.1090/coll/025openalex-snapshot

Lattice Theory

inferredcites →https://doi.org/10.2307/2266170openalex-snapshot

A formulation of the simple theory of types

What points at this work

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

inferred← citeshttps://doi.org/10.1002/malq.19810270205openalex-snapshot

Functional Characters of Solvable Terms

inferred← citeshttps://doi.org/10.1007/3-540-09510-1_11openalex-snapshot

Functional characterization of some semantic equalities inside λ-calculus

inferred← citeshttps://doi.org/10.1007/3-540-11494-7_15openalex-snapshot

The simple semantics for Coppo-Dezani-Sallé types

inferred← citeshttps://doi.org/10.1007/3-540-13346-1_14openalex-snapshot

F-semantics for intersection type discipline

inferred← citeshttps://doi.org/10.1007/3-540-15198-2_7openalex-snapshot

Three approaches to type structure

inferred← citeshttps://doi.org/10.1007/3-540-36377-7_10openalex-snapshot

Types in Program Analysis

inferred← citeshttps://doi.org/10.1007/3-540-45309-1_5openalex-snapshot

Enforcing Safety Properties Using Type Specialization

inferred← citeshttps://doi.org/10.1007/3-540-45500-0_22openalex-snapshot

Infinite Intersection and Union Types for the Lazy Lambda Calculus

inferred← citeshttps://doi.org/10.1007/3-540-48168-0_30openalex-snapshot

Anti-Symmetry of Higher-Order Subtyping

inferred← citeshttps://doi.org/10.1007/3-540-51285-3_52openalex-snapshot

The typed λ-calculus with first-class processes

inferred← citeshttps://doi.org/10.1007/978-0-387-21798-7_14openalex-snapshot

Type systems

inferred← citeshttps://doi.org/10.1007/978-1-4612-4118-8_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_8openalex-snapshot

Syntactic Control of Interference Revisited

inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_2openalex-snapshot

Factoring Derivation Spaces via Intersection Types

inferred← citeshttps://doi.org/10.1007/978-3-030-02768-1_3openalex-snapshot

Types of Fireballs

inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_15openalex-snapshot

Types by Need

inferred← citeshttps://doi.org/10.1007/978-3-030-39951-1_8openalex-snapshot

Towards Probabilistic Reasoning in Type Theory - The Intersection Type Case

inferred← citeshttps://doi.org/10.1007/978-3-030-59025-3_2openalex-snapshot

The Bang Calculus Revisited

inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_18openalex-snapshot

The Spirit of Node Replication

inferred← citeshttps://doi.org/10.1007/978-3-031-34518-0_7openalex-snapshot

Semantics and Syntax, Between Computer Science and Mathematics

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-57262-3openalex-snapshot

Programming Languages and Systems

inferred← citeshttps://doi.org/10.1007/978-3-031-57262-3_2openalex-snapshot

Monadic Intersection Types, Relationally

inferred← citeshttps://doi.org/10.1007/978-3-031-98679-6_4openalex-snapshot

On the Almost-Sure Termination of Probabilistic Counter Programs

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-25150-9_23openalex-snapshot

A Resource Aware Computational Interpretation for Herbelin’s Syntax

inferred← citeshttps://doi.org/10.1007/978-3-319-68732-2_2openalex-snapshot

Formal Systems, Logics, and Programs

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-24849-1_15openalex-snapshot

Classical Proofs, Typed Processes, and Intersection Types

inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_17openalex-snapshot

Full Abstraction for Polymorphic Pi-Calculus

inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_6openalex-snapshot

Characterising Strongly Normalising Intuitionistic Sequent Terms

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-642-13824-9_19openalex-snapshot

Intersection Type Systems and Explicit Substitutions Calculi

inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_7openalex-snapshot

Complexity of Strongly Normalising λ-Terms via Non-idempotent Intersection Types

inferred← citeshttps://doi.org/10.1007/978-3-642-23283-1_10openalex-snapshot

Intersection Types for the Resource Control Lambda Calculi

inferred← citeshttps://doi.org/10.1007/978-3-642-27694-1_21openalex-snapshot

Typing the Numeric Tower

inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_12openalex-snapshot

Call-by-Value Non-determinism in a Linear Logic Type Discipline

inferred← citeshttps://doi.org/10.1007/978-3-642-39038-8_2openalex-snapshot

Feature-Oriented Programming with Object Algebras

inferred← citeshttps://doi.org/10.1007/978-3-662-44602-7_23openalex-snapshot

Quantitative Types for the Linear Substitution Calculus

inferred← citeshttps://doi.org/10.1007/978-3-662-49630-5_25openalex-snapshot

Reasoning About Call-by-need by Means of Types

inferred← citeshttps://doi.org/10.1007/978-981-97-8943-6_5openalex-snapshot

Extending the Quantitative Pattern-Matching Paradigm

inferred← citeshttps://doi.org/10.1007/bf01211394openalex-snapshot

Types with intersection: An introduction

inferred← citeshttps://doi.org/10.1007/bf01880331openalex-snapshot

Implementing the ‘Fool's model’ of combinatory logic

inferred← citeshttps://doi.org/10.1007/bfb0013458openalex-snapshot

Linear logic and interference control

inferred← citeshttps://doi.org/10.1007/bfb0022246openalex-snapshot

Decidability of higher-order subtyping with intersection types

inferred← citeshttps://doi.org/10.1007/bfb0037117openalex-snapshot

Intersection types and bounded polymorphism

inferred← citeshttps://doi.org/10.1016/0167-6423(89)90016-6openalex-snapshot

Elementary data structures in ALGOL-like languages

inferred← citeshttps://doi.org/10.1016/0168-0072(88)90017-6openalex-snapshot

On church's formal theory of functions and functionals

inferred← citeshttps://doi.org/10.1016/0304-3975(83)90074-9openalex-snapshot

Coppo-Dezani types do not correspond to propositional logic

inferred← citeshttps://doi.org/10.1016/0304-3975(86)90043-5openalex-snapshot

A characterization of F-complete type assignments

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00017-8openalex-snapshot

From CML to its process algebra

inferred← citeshttps://doi.org/10.1016/0890-5401(87)90042-3openalex-snapshot

Type theories, normal forms, and D∞-lambda-models

inferred← citeshttps://doi.org/10.1016/0890-5401(92)90020-gopenalex-snapshot

Type reconstruction in finite rank fragments of the second-order λ-calculus

inferred← citeshttps://doi.org/10.1016/j.apal.2007.02.001openalex-snapshot

A completeness result for a realisability semantics for an intersection type system

inferred← citeshttps://doi.org/10.1016/j.apal.2008.01.005openalex-snapshot

Classical Fω , orthogonality and symmetric candidates

inferred← citeshttps://doi.org/10.1016/j.apal.2010.04.010openalex-snapshot

Completeness and partial soundness results for intersection and union typing for λ¯μμ

inferred← citeshttps://doi.org/10.1016/j.apal.2011.06.021openalex-snapshot

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.026openalex-snapshot

Expansion: the Crucial Mechanism for Type Inference with Intersection Types: A Survey and Explanation

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.06.010openalex-snapshot

Intersection and Union Types in the λ¯μμ˜ -calculus

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.011openalex-snapshot

Definability and Full Abstraction

inferred← citeshttps://doi.org/10.1016/j.entcs.2016.09.045openalex-snapshot

How to Think of Intersection Types as Cartesian Products

inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.004openalex-snapshot

Intersection types for explicit substitutions

inferred← citeshttps://doi.org/10.1016/j.ic.2004.01.001openalex-snapshot

Higher-order subtyping and its decidability

inferred← citeshttps://doi.org/10.1016/j.ic.2023.105047openalex-snapshot

The bang calculus revisited

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.020openalex-snapshot

Full abstraction for polymorphic π -calculus

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.018openalex-snapshot

Calculi, types and applications

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.022openalex-snapshot

Characterizing strong normalization in the Curien–Herbelin symmetric lambda calculus: Extending the Coppo–Dezani heritage

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.01.046openalex-snapshot

A typed lambda calculus with intersection types

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.05.008openalex-snapshot

Nominal essential intersection types

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70234-9openalex-snapshot

References

inferred← citeshttps://doi.org/10.1016/s0168-0072(00)00030-0openalex-snapshot

Normalization without reducibility

inferred← citeshttps://doi.org/10.1016/s0168-0072(03)00002-2openalex-snapshot

System ST toward a type system for extraction and proofs of programs

inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00047-xopenalex-snapshot

Typing untyped λ-terms, or reducibility strikes again!

inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00096-5openalex-snapshot

Higher-order subtyping

inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00359-4openalex-snapshot

Syntactic control of interference revisited

inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00143-3openalex-snapshot

Infinite intersection types

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00026-xopenalex-snapshot

Syntactic Control of Interference Revisited

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00172-0openalex-snapshot

Hyperformulae, Parallel Deductions and Intersection Types

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80493-6openalex-snapshot

Reducibility

inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70018-4openalex-snapshot

Lambda-Calculus and Combinators in the 20th Century

inferred← citeshttps://doi.org/10.1017/s095679682000012xopenalex-snapshot

Tight typings and split bounds, fully developed

inferred← citeshttps://doi.org/10.1017/s0956796825100026openalex-snapshot

A contextual formalization of structural coinduction

inferred← citeshttps://doi.org/10.1017/s0960129500000311openalex-snapshot

A model for syntactic control of interference

inferred← citeshttps://doi.org/10.1017/s0960129500070043openalex-snapshot

Higher-order intersection types and multiple inheritance

inferred← citeshttps://doi.org/10.1017/s0960129502003821openalex-snapshot

Reductions, intersection types, and explicit substitutions

inferred← citeshttps://doi.org/10.1017/s0960129505005086openalex-snapshot

Anti-symmetry of higher-order subtyping and equality by subtyping

inferred← citeshttps://doi.org/10.1017/s0960129517000111openalex-snapshot

A resource aware semantics for a focused intuitionistic calculus

inferred← citeshttps://doi.org/10.1017/s0960129525100285openalex-snapshot

A quantitative approach to global state composition

inferred← citeshttps://doi.org/10.1017/s096012959600223xopenalex-snapshot

Intersection types and bounded polymorphism

inferred← citeshttps://doi.org/10.1051/ita/1980140201431openalex-snapshot

Une généralisation de la théorie des types en $\lambda $-calcul

inferred← citeshttps://doi.org/10.1051/ita/1980140303011openalex-snapshot

Une généralisation de la théorie des types en $\lambda $-calcul (II)

inferred← citeshttps://doi.org/10.1088/1742-6596/1187/4/042046openalex-snapshot

Characterizing of Strong Normalization forΛμ-Calculus

inferred← citeshttps://doi.org/10.1093/jigpal/jzu044openalex-snapshot

Explicit substitution calculi with de Bruijn indices and intersection type systems

inferred← citeshttps://doi.org/10.1093/jigpal/jzx018openalex-snapshot

Non-idempotent intersection types for the Lambda-Calculus

inferred← citeshttps://doi.org/10.1109/iccl.1994.288390openalex-snapshot

Haskell-style overloading is NP-hard

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470617openalex-snapshot

Intersection Type Distributors

inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470726openalex-snapshot

The Space of Interaction

inferred← citeshttps://doi.org/10.1145/1557898.1557901openalex-snapshot

Semantic predicate types and approximation for class-based object oriented programming

inferred← citeshttps://doi.org/10.1145/2643135.2643142openalex-snapshot

Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes

inferred← citeshttps://doi.org/10.1145/2784731.2784737openalex-snapshot

Blame assignment for higher-order contracts with intersection and union

inferred← citeshttps://doi.org/10.1145/286936.286975openalex-snapshot

Compound types for Java

inferred← citeshttps://doi.org/10.1145/286942.286975openalex-snapshot

Compound types for Java

inferred← citeshttps://doi.org/10.1145/3131851.3131867openalex-snapshot

Characterization of strong normalizability for a sequent lambda calculus with co-control

inferred← citeshttps://doi.org/10.1145/3149823openalex-snapshot

Characterisation of Normalisation Properties for λμ using Strict Negated Intersection Types

inferred← citeshttps://doi.org/10.1145/3236789openalex-snapshot

Tight typings and split bounds

inferred← citeshttps://doi.org/10.1145/3236950.3236968openalex-snapshot

On Intersection Types and Probabilistic Lambda Calculi

inferred← citeshttps://doi.org/10.1145/3276482openalex-snapshot

Empowering union and intersection types with integrated subtyping

inferred← citeshttps://doi.org/10.1145/3276504openalex-snapshot

The root cause of blame: contracts for intersection and union types

inferred← citeshttps://doi.org/10.1145/3290320openalex-snapshot

Intersection types and runtime errors in the pi-calculus

inferred← citeshttps://doi.org/10.1145/3331453.3360959openalex-snapshot

Characterizing Strongly Normalizing λGtz-terms via Non-Idempotent Intersection Types

inferred← citeshttps://doi.org/10.1145/3371136openalex-snapshot

Pointer life cycle types for lock-free data structures with memory reclamation

inferred← citeshttps://doi.org/10.1145/3373718.3394774openalex-snapshot

Consuming and Persistent Types for Classical Logic

inferred← citeshttps://doi.org/10.1145/3434313openalex-snapshot

Intersection types and (positive) almost-sure termination

inferred← citeshttps://doi.org/10.1145/3434332openalex-snapshot

The (In)Efficiency of interaction

inferred← citeshttps://doi.org/10.1145/3547650openalex-snapshot

Multi types and reasonable space

inferred← citeshttps://doi.org/10.1145/3547652openalex-snapshot

The theory of call-by-value solvability

inferred← citeshttps://doi.org/10.1145/3571244openalex-snapshot

Quantitative Inhabitation for Different Lambda Calculi in a Unifying Framework

inferred← citeshttps://doi.org/10.1145/3632926openalex-snapshot

Higher Order Bayesian Networks, Exactly

inferred← citeshttps://doi.org/10.1145/3661814.3662113openalex-snapshot

Genericity Through Stratification

inferred← citeshttps://doi.org/10.1145/3729299openalex-snapshot

Functional Meaning for Parallel Streaming

inferred← citeshttps://doi.org/10.1145/3777483openalex-snapshot

Monadic Intersection Types, Relationally, and Ordered

inferred← citeshttps://doi.org/10.1145/567067.567077openalex-snapshot

Polymorphic type inference

inferred← citeshttps://doi.org/10.2168/lmcs-5(3:1)2009openalex-snapshot

A Theory of Explicit Substitutions with Safe and Full Composition

inferred← citeshttps://doi.org/10.2178/jsl/1190150049openalex-snapshot

A classification of intersection type systems

inferred← citeshttps://doi.org/10.26686/ajl.v6i0.1792openalex-snapshot

Church-Rosser property and intersection types

inferred← citeshttps://doi.org/10.3233/fi-2012-772openalex-snapshot

Characterising Strongly Normalising Intuitionistic Terms

inferred← citeshttps://doi.org/10.3389/fcomp.2022.792570openalex-snapshot

Semantics for Combinatory Logic With Intersection Types

inferred← citeshttps://doi.org/10.4204/eptcs.121.1openalex-snapshot

Characterisation of Strongly Normalising lambda-mu-Terms

inferred← citeshttps://doi.org/10.4204/eptcs.293.1openalex-snapshot

Quantitative Types: From Foundations to Applications

inferred← citeshttps://doi.org/10.4204/eptcs.293.3openalex-snapshot

Natural Deduction and Normalization Proofs for the Intersection Type Discipline

inferred← citeshttps://doi.org/10.4204/eptcs.293.5openalex-snapshot

Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus

inferred← citeshttps://doi.org/10.4204/eptcs.45.3openalex-snapshot

Sound and Complete Typing for lambda-mu

inferred← citeshttps://doi.org/10.4204/eptcs.45.7openalex-snapshot

Equality, Quasi-Implicit Products, and Large Eliminations

inferred← citeshttps://doi.org/10.4230/lipics.csl.2011.51openalex-snapshot

Filter Models: Non-idempotent Intersection Types, Orthogonality and Polymorphism

inferred← citeshttps://doi.org/10.4230/lipics.ecoop.2015.28openalex-snapshot

TreatJS: Higher-Order Contracts for JavaScripts

inferred← citeshttps://doi.org/10.46298/lmcs-19(4:1)2023openalex-snapshot

Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1504.08110openalex-snapshot

TreatJS: Higher-Order Contracts for JavaScript

inferred← citeshttps://doi.org/10.48550/arxiv.1812.10799openalex-snapshot

Towards a Semantic Measure of the Execution Time in Call-by-Value lambda-Calculus (Long Version)

inferred← citeshttps://doi.org/10.48550/arxiv.1902.05945openalex-snapshot

Types by Need (Extended Version)

inferred← citeshttps://doi.org/10.48550/arxiv.2104.13795openalex-snapshot

The Space of Interaction (long version)

inferred← citeshttps://doi.org/10.5281/zenodo.26337openalex-snapshot

Epimyrma Bernardi N. Sp., A New Parasitic Ant (Hymenoptera, Formicidae).

inferred← citeshttps://doi.org/10.5287/ora-o8oygp8pnopenalex-snapshot

Intersection types and higer-order model checking

inferred← citeshttps://doi.org/10.70675/22ef231fzd622z41a8z8ea5z8b29a2998b2copenalex-snapshot

Contrôle du calcul et limites du sens : fonctions, computation et types de G. Frege à A.Church

inferred← citeshttps://doi.org/10.70675/2ba96c68z9506z47e0z8d13zf4cb43296358openalex-snapshot

Sized Types Methods and their Applications to Complexity Analysis in Pi-Calculus

inferred← citeshttps://doi.org/10.70675/528a189dz6263z4b1dz95bdz158fff7ad77eopenalex-snapshot

Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage

inferred← citeshttps://doi.org/10.70675/8e153fb0z54c9z4004z8b28za822c1e74a78openalex-snapshot

Automatic verification of higher-order functional programs using regular tree languages

inferred← citeshttps://doi.org/10.70675/d0680a12zfb6ez4cbdzae51z43d98d5b093copenalex-snapshot

Intersection types and ressource calculi in the denotational semantics of lambda-calculus

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.