Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus

DOI10.4230/LIPIcs.RTA.2012.323zbMath1437.03054OpenAlexW2246934006MaRDI QIDQ5111914

Kazushige Terui

Publication date: 27 May 2020

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3501/pdf/24.pdf

zbMATH Keywords

computational complexitydenotational semanticsintersection typessimply typed lambda-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatory logic and lambda calculus (03B40)

Related Items (8)

Bounded combinatory logic and lower complexity ⋮ Finitary Semantics of Linear Logic and Higher-Order Model-Checking ⋮ Functional programs as compressed data ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lambda calculus with algebraic simplification for reduction parallelisation: Extended study ⋮ The IO and OI hierarchies revisited ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: Semantic Evaluation, Intersection Types and Complexity of Simply Typed Lambda Calculus