Abstract Böhm trees

DOI10.1017/S0960129598002631MaRDI QIDQ4236200zbMATH OpenOpenAlexFDO

Authors 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

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

Mathematics Subject Classification ID

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

Recommendations

• Regular Böhm trees
• Böhm trees as higher-order recursion schemes
• scientific article; zbMATH DE number 1497857
• Comparing Böhm-Like Trees
• Computing with Böhm trees
• Tree quantum field theory
• Probabilistic Böhm trees and probabilistic separation
• Trees on hyperbolic lattices
• scientific article; zbMATH DE number 796948
• Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus

Cited in

(14)

• On full abstraction for PCF: I, II and III
• Processes and games
• Böhm trees as higher-order recursion schemes
• scientific article; zbMATH DE number 2185718 (Why is no real title available?)
• On the Meaning of Logical Completeness
• Thick Subtrees, Games and Experiments
• An approach to innocent strategies as graphs
• Infinitary affine proofs
• Preface to the special volume
• Computational ludics
• Game semantics of Martin-Löf type theory
• Totality in arena games
• Disentangling parallelism and interference in game semantics
• Interactive observability in Ludics: the geometry of tests

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4236200)