scientific article; zbMATH DE number 1223626

zbMath0908.03022MaRDI QIDQ4218937

Martin Hofmann

Publication date: 15 November 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

category-theoretic modelhigher-order generalizations of Bellantoni-Cook's function algebralinear function spaceS4 modalitysimply-typed lambda calculus

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Combinatory logic and lambda calculus (03B40)

Related Items (13)

Higher-order interpretations and program complexity ⋮ On Equivalences, Metrics, and Polynomial Time ⋮ Probabilistic Termination by Monadic Affine Sized Typing ⋮ Combining linear logic and size types for implicit complexity ⋮ Unnamed Item ⋮ A Calculus for Game-Based Security Proofs ⋮ Structural recursion as a query language on lists and ordered trees ⋮ The Computational SLR: A Logic for Reasoning about Computational Indistinguishability ⋮ Higher type recursion, ramification and polynomial time ⋮ Safe recursion with higher types and BCK-algebra ⋮ Formal security proofs with minimal fuss: implicit computational complexity at work ⋮ A higher-order characterization of probabilistic polynomial time ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: