13 papers:
LICS-CSL-2014-TsukadaO #composition #game studies #higher-order #model checking- Compositional higher-order model checking via ω-regular games over Böhm trees (TT, CHLO), p. 10.
TLCA-2011-ManzonettoP #theorem #λ-calculus- Böhm’s Theorem for Resource λ Calculus through Taylor Expansion (GM, MP), pp. 153–168.
FLOPS-2010-Saurin #standard #λ-calculus #μ-calculus- Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.
RTA-2010-Bahr10a #partial order #term rewriting- Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
- RTA-2009-Ketema
- Comparing Böhm-Like Trees (JK), pp. 239–254.
CSL-2005-SeveriV #modelling #order- Order Structures on Böhm-Like Models (PS, FJdV), pp. 103–118.
- RTA-2004-Ketema #term rewriting
- Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.
- RTA-2002-SeveriV
- An Extensional Böhm Model (PS, FJdV), pp. 159–173.
- CSL-1999-KerNO #game studies
- A Universal Innocent Game Model for the Böhm Tree λ Theory (ADK, HN, CHLO), pp. 405–419.
- FLOPS-1998-CurienH
- Computing with Abstract Böhm Trees (PLC, HH), pp. 20–39.
- TLCA-1997-Kurata
- A Type Theoretical View of Böhm-Trees (TK), pp. 231–247.
- RTA-1995-KennawayKSV #modelling #λ-calculus
- Infinitary λ Calculi and Böhm Models (RK, JWK, MRS, FJdV), pp. 257–270.
- RTA-1993-Ariola #graph #modelling #term rewriting
- Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.
