Abstract Böhm trees

DOI10.1017/S0960129598002631zbMath0923.03021OpenAlexW2054684736MaRDI QIDQ4236200

Pierre-Louis Curien

Publication date: 28 October 1999

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129598002631

zbMATH Keywords

cut-free proofsgame models\(\lambda\)-calculus based languagesabstract Böhm treesmulti-categorynormal termsNovikov's infinitary propositional logictrees with pointersview abstract machine

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Combinatory logic and lambda calculus (03B40)

Related Items (11)

An approach to innocent strategies as graphs ⋮ Game semantics of Martin-Löf type theory ⋮ Totality in arena games ⋮ Preface to the special volume ⋮ Computational ludics ⋮ Unnamed Item ⋮ On the Meaning of Logical Completeness ⋮ Thick Subtrees, Games and Experiments ⋮ On full abstraction for PCF: I, II and III ⋮ Infinitary affine proofs ⋮ Interactive observability in Ludics: the geometry of tests

This page was built for publication: Abstract Böhm trees