BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (8)
model (6)
term (3)
rewrit (3)
order (3)

Stem böhm$ (all stems)

13 papers:

LICSLICS-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.
TLCATLCA-2011-ManzonettoP #theorem #λ-calculus
Böhm’s Theorem for Resource λ Calculus through Taylor Expansion (GM, MP), pp. 153–168.
FLOPSFLOPS-2010-Saurin #standard #λ-calculus #μ-calculus
Standardization and Böhm Trees for λμ-Calculus (AS), pp. 134–149.
RTARTA-2010-Bahr10a #partial order #term rewriting
Partial Order Infinitary Term Rewriting and Böhm Trees (PB), pp. 67–84.
Comparing Böhm-Like Trees (JK), pp. 239–254.
CSLCSL-2005-SeveriV #modelling #order
Order Structures on Böhm-Like Models (PS, FJdV), pp. 103–118.
RTARTA-2004-Ketema #term rewriting
Böhm-Like Trees for Term Rewriting Systems (JK), pp. 233–248.
An Extensional Böhm Model (PS, FJdV), pp. 159–173.
CSLCSL-1999-KerNO #game studies
A Universal Innocent Game Model for the Böhm Tree λ Theory (ADK, HN, CHLO), pp. 405–419.
Computing with Abstract Böhm Trees (PLC, HH), pp. 20–39.
A Type Theoretical View of Böhm-Trees (TK), pp. 231–247.
RTARTA-1995-KennawayKSV #modelling #λ-calculus
Infinitary λ Calculi and Böhm Models (RK, JWK, MRS, FJdV), pp. 257–270.
RTARTA-1993-Ariola #graph #modelling #term rewriting
Relating Graph and Term Rewriting via Böhm Models (ZMA), pp. 183–197.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.