scientific article; zbMATH DE number 3961577
From MaRDI portal
Publication:3728878
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65)
Cited in
(79)- Unsolvable algorithmic problems for semigroups, groups and rings
- Enlargements of functional algebras for the lambda calculus
- How to decide the lark
- A finite equational axiomatization of the functional algebras for the lambda calculus
- Composition structure of programmology
- Some examples of non-existent combinators
- A fuzzy language.
- On the algebraic models of lambda calculus
- Foundations of programmology
- Decomposition of data mining algorithms into unified functional blocks
- On finitely presented and free algebras of Cantor varieties
- A typed resolution principle for deduction with conditional typing theory
- The abstract variable-binding calculus
- Programmological aspects of the fixed point method
- Fixed points and closure operators: Programmological aspects
- Mixed sessions
- A complete equational axiomatisation of partial differentiation
- Finite generation and presentation problems for lambda calculus and combinatory logic
- The untyped computational \(\lambda \)-calculus and its intersection type discipline
- \texttt{EVL}: a typed higher-order functional language for events
- Pure pattern calculus à la de Bruijn
- The spirit of node replication
- New proofs of important theorems of untyped extensional \(\lambda\) calculus
- Proof, meaning and paradox: some remarks
- Confluence by critical pair analysis revisited
- Multiple data structuring
- Descriptological foundations of information technologies
- Genericity and the \(\pi\)-calculus
- Differential logical relations. II: Increments and derivatives
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Least upper bounds on the size of Church-Rosser diagrams in term rewriting and -calculus
- Comparing Böhm-Like Trees
- An estimation for the lengths of reduction sequences of the \(\lambda\mu\rho\theta\)-calculus
- Truncation and semi-decidability notions in applicative theories
- Reversible session-based pi-calculus
- Explicit substitutions
- Mixed sessions
- On sets of terms having a given intersection type
- Optimal reductions in interaction systems
- Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus
- Efficiency of lambda-encodings in total type theory
- Infinitary combinatory reduction systems
- How to normalize the Jay
- A logical framework with higher-order rational (circular) terms
- From semantics to types: the case of the imperative \(\lambda\)-calculus
- A Formal Proof of the Strong Normalization Theorem for System T in Agda
- The reflective higher-order calculus: encodability, typability and separation
- Algebraic interpretation of lambda calculus with resources
- Node Replication: Theory And Practice
- System \(F^\mu_\omega\) with context-free session types
- An encoding of the \(\lambda \)-calculus in the string MultiSet rewriting calculus
- Higher-order annotated terms for proof search
- Clones, closed categories, and combinatory logic
- An ML-style record calculus with extensible records
- Disproving termination of non-erasing sole combinatory calculus with tree automata
- Realizability models for large cardinals
- From thin concurrent games to generalized species of structures (extended version)
- A reflection principle for potential infinite models of type theory
- Böhm and Taylor for all!
- Sharing and linear logic with restricted access
- A quantitative approach to global state composition
- Call-by-value and call-by-name: a simple proof of a classic theorem
- Can't you answer while you wait?
- A sound and complete projection for global types
- Braids, twists, trace and duality in combinatory algebras
- A logical approach to type soundness
- Universal algebra in UniMath
- On complexity of confluence and Church-Rosser proofs
- Extensional Taylor expansion
- The lambda calculus is quantifiable
- Should computations halt?
- Lambda galore
- Animating MRBNFs: truly modular binding-aware datatypes in Isabelle/HOL
- Scott's representation theorem and the univalent Karoubi envelope
- A note on the notation of recursion in process algebras
- On basic semantics of untyped functional programs
- A completeness result for a realisability semantics for an intersection type system
- Existential foundations of the composition paradigm
- On the formal semantics of IF-like logics
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3728878)
