Functionality in Combinatory Logic

Cited in

(29)

Complete restrictions of the intersection type discipline
Intersection type assignment systems
Comparing cubes of typed and type assignment systems
From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
Adding logic to the toolbox of molecular biology
Questions as information types
Normalization, approximation, and semantics for combinator systems
Meaning and computing: two approaches to computable propositions
Why ramify?
Logic of subtyping
From realizability to induction via dependent intersection
Homotopy type theory and Voevodsky's univalent foundations
Observed Communication Semantics for Classical Processes
π-RED⁺ An interactive compiling graph reduction system for an applied λ-calculus
Substructural proofs as automata
Conflation confers concurrency
Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information
Extending the Curry-Howard interpretation to linear, relevant and other resource logics
Systems of illative combinatory logic complete for first-order propositional and predicate calculus
The Impact of the Lambda Calculus in Logic and Computer Science
Cut-elimination in the strict intersection type assignment system is strongly normalizing
A light-weight integration of automated and interactive theorem proving
A Survey of the Proof-Theoretic Foundations of Logic Programming
Type inference for rank-2 intersection types using set unification
Adding Negation to Lambda Mu
Structural rules and algebraic properties of intersection types
Quantitative weak linearisation
On modal logics of partial recursive functions
ProofViz: an interactive visual proof explorer

This page was built for publication: Functionality in Combinatory Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4758660)