There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

Related collections

Most cited references 19

Record: found
Abstract: not found
Article: not found

LCF considered as a programming language

G.D. Plotkin (1977)

0 comments Cited 112 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Article: not found

Indexed Grammars---An Extension of Context-Free Grammars

Alfred V. Aho (1968)

0 comments Cited 37 times – based on 0 reviews      Review now

Bookmark

Record: found
Abstract: not found
Book Chapter: not found

Higher-Order Pushdown Trees Are Easy

Teodor Knapik, Damian Niwinski, Paweł Urzyczyn (2002)

0 comments Cited 29 times – based on 0 reviews

Bookmark

All references

Author and book information

Book Chapter

Publication date (Print): 2012

Pages: 6-20

DOI: 10.1007/978-3-642-33512-9_2

SO-VID: d76cf36f-d11c-4dfa-9e0c-e8b5af836f4a

History

Data availability:

Comments

Comment on this book

Book chapters

Cited by 2

Using Models to Model-Check Recursive Schemes
Authors: Sylvain Salvati, Igor Walukiewicz
Using models to model-check recursive schemes
Authors: ,

See all cited by

Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata

Read this book at

Related collections

Recursive Rule based Visual Categorization

Most cited references 19

LCF considered as a programming language

Indexed Grammars---An Extension of Context-Free Grammars

Higher-Order Pushdown Trees Are Easy

Author and book information

Book Chapter

History

Comments

Comment on this book

Book chapters

Similar content 5,606

Cited by 2