Typed Lambda Calculi and Applications
From MaRDI portal
Publication:5704015
DOI10.1007/b135690zbMath1114.68035OpenAlexW2501230561MaRDI QIDQ5704015
Publication date: 11 November 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b135690
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)
Related Items (10)
Normalization by evaluation and algebraic effects ⋮ Strongly-Normalizing Higher-Order Relational Queries ⋮ Unnamed Item ⋮ On Normalization by Evaluation for Object Calculi ⋮ Deciding contextual equivalence of \(\nu \)-calculus with effectful contexts ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ A Characterisation of Lambda Definability with Sums Via ⊤ ⊤-Closure Operators ⋮ Relating Computational Effects by ⊤ ⊤-Lifting ⋮ Codensity Lifting of Monads and its Dual ⋮ On the Values of Reducibility Candidates
This page was built for publication: Typed Lambda Calculi and Applications
