scientific article
From MaRDI portal
Publication:3728878
zbMath0597.03009MaRDI QIDQ3728878
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)
Related Items (54)
Mixed Sessions ⋮ On sets of terms having a given intersection type ⋮ Optimal reductions in interaction systems ⋮ A complete equational axiomatisation of partial differentiation ⋮ On basic semantics of untyped functional programs ⋮ The abstract variable-binding calculus ⋮ Finite generation and presentation problems for lambda calculus and combinatory logic ⋮ Programmological aspects of the fixed point method ⋮ Fixed points and closure operators: Programmological aspects ⋮ Unsolvable algorithmic problems for semigroups, groups and rings ⋮ Differential logical relations. II: Increments and derivatives ⋮ A completeness result for a realisability semantics for an intersection type system ⋮ Enlargements of functional algebras for the lambda calculus ⋮ A logical framework with higher-order rational (circular) terms ⋮ From semantics to types: the case of the imperative \(\lambda\)-calculus ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ 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 ⋮ Multiple data structuring ⋮ Efficiency of lambda-encodings in total type theory ⋮ The untyped computational \(\lambda \)-calculus and its intersection type discipline ⋮ A fuzzy language. ⋮ \texttt{EVL}: a typed higher-order functional language for events ⋮ Pure pattern calculus à la de Bruijn ⋮ The spirit of node replication ⋮ Reversible session-based pi-calculus ⋮ Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus ⋮ Existential foundations of the composition paradigm ⋮ Formalisation in constructive type theory of Stoughton's substitution for the lambda calculus ⋮ Descriptological foundations of information technologies ⋮ How to decide the lark ⋮ New proofs of important theorems of untyped extensional \(\lambda\) calculus ⋮ Infinitary combinatory reduction systems ⋮ How to normalize the Jay ⋮ An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus ⋮ On the formal semantics of IF-like logics ⋮ Explicit substitutions ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES ⋮ Decomposition of data mining algorithms into unified functional blocks ⋮ Proof, meaning and paradox: some remarks ⋮ A note on the notation of recursion in process algebras ⋮ Mixed sessions ⋮ Confluence by critical pair analysis revisited ⋮ Comparing Böhm-Like Trees ⋮ A finite equational axiomatization of the functional algebras for the lambda calculus ⋮ Composition structure of programmology ⋮ On the algebraic models of lambda calculus ⋮ On finitely presented and free algebras of Cantor varieties ⋮ Genericity and the \(\pi\)-calculus ⋮ Foundations of programmology ⋮ A typed resolution principle for deduction with conditional typing theory ⋮ Some examples of non-existent combinators
This page was built for publication:
