scientific article; zbMATH DE number 3875232
From MaRDI portal
Publication:3342534
Recommendations
Cited in
(81)- On the implementation of abstract data types by programming language constructs
- Needed reduction and spine strategies for the lambda calculus
- Every countable poset is embeddable in the poset of unsolvable terms
- Combinatory weak reduction in lambda calculus
- Recursion over realizability structures
- Partial inductive definitions
- Normal forms for a class of formulas
- Constructive \(\lambda\)-models
- Strictness analysis via abstract interpretation for recursively defined types
- Characterizing complexity classes by higher type primitive recursive definitions
- Extension of combinatory logic to a theory of combinatory representation
- On the adequacy of representing higher order intuitionistic logic as a pure type system
- Intersection types for combinatory logic
- Ordinals and ordinal functions representable in the simply typed lambda calculus
- An equivalence between lambda- terms
- Classical logic, storage operators and second-order lambda-calculus
- The Inf function in the system \(F\)
- Formalizing non-termination of recursive programs
- A unified approach to type theory through a refined -calculus
- Equational programming in -calculus via SL-systems. Part 1
- Equational programming in -calculus via SL-systems. Part 2
- Theories with self-application and computational complexity.
- On the semantics of the call-by-name CPS transform
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
- A fully abstract denotational semantics for the \(\pi\)-calculus
- A proof of the leftmost reduction theorem for -calculus
- Higher-order unification revisited: Complete sets of transformations
- Realizability models for BLL-like languages
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus
- Higher order unification via explicit substitutions
- Games characterizing Levy-Longo trees
- The differential lambda-calculus
- Strong normalization in type systems: A model theoretical approach
- Totality in applicative theories
- On perfect ideals of seminearrings
- Partial combinatory algebra and generalized numberings
- Fixed point theorems for precomplete numberings
- Term-generic logic
- Why ramify?
- A synchronous -calculus
- Shallow confluence of conditional term rewriting systems
- A structural approach to reversible computation
- C-system of a module over a \(Jf\)-relative monad
- scientific article; zbMATH DE number 1696772 (Why is no real title available?)
- Type inference using constraint handling rules
- scientific article; zbMATH DE number 5852776 (Why is no real title available?)
- Term-Generic Logic
- The lambda calculus: practice and principle
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- scientific article; zbMATH DE number 5318491 (Why is no real title available?)
- An Introduction to the Lambda Calculus
- Supra-logic: using transfinite type theory with type variables for paraconsistency
- Semantics of the second order lambda calculus
- scientific article; zbMATH DE number 1984518 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 783760 (Why is no real title available?)
- scientific article; zbMATH DE number 919545 (Why is no real title available?)
- Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
- Models of the lambda calculus: an introduction
- Fully abstract models of the probabilistic -calculus
- Modal embeddings and calling paradigms
- Hypergraph basic categorial grammars
- On sets of solutions to combinator equations
- Parallel reductions in \(\lambda\)-calculus
- Constant time parallel computations in \(\lambda\)-calculus
- Higher-order subtyping and its decidability
- A note on preservation of strong normalisation in the \(\lambda \)-calculus
- Towards a proof theory of rewriting: The simply typed \(2\lambda\)-calculus
- A multiset semantics for the pi-calculus with replication
- A proof-theoretic characterization of the basic feasible functionals
- A note on inconsistencies caused by fixpoints in a cartesian closed category
- About systems of equations, X-separability, and left-invertibility in the \(\lambda\)-calculus
- Stability and computability in coherent domains
- Telescopic mappings in typed lambda calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Kripke-style models for typed lambda calculus
- Abstract abstract reduction
- Implementing term rewrite languages in DACTL
- Confluence results for the pure strong categorical logic CCL. \(\lambda\)- calculi as subsystems of CCL
- Lambda calculus with patterns
- On strong normalization and type inference in the intersection type discipline
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 Q3342534)
