Languages Defined by Higher Type Program Schemes
Werner Damm
- 18 Jul 1977
- pp 164-179
About: This article is published in International Colloquium on Automata, Languages and Programming. The article was published on 18 Jul 1977. and is currently open access. The article focuses on the topics: Type (model theory).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Collapsible Pushdown Automata and Recursion Schemes
Matthew Hague,Andrzej S. Murawski,C.-H.L. Ong,Olivier Serre +3 more
- 24 Jun 2008
TL;DR: It is shown that the problem of solving parity games over the configuration graphs of order-n CPDA is n-EXPTIME complete, subsuming several well-known results about the solvability of games over higher-order pushdown graphs by (respectively) Walukiewicz, Cachat, and Knapik et al.
•Dissertation
Semantics of linear logic and higher-order model-checking
Charles Grellois
- 08 Apr 2016
TL;DR: The definition of an alternative intersection type system, which enjoys a similar soundness-and-completeness theorem with respect to higher-order model-checking, and equip the semantics of linear logic with an inductive-coinductive fixpoint operator.
18
Model Checking and Functional Program Transformations
Axel Haddad
- 12 Dec 2013
TL;DR: New proofs of two verification related problems: reflection and selection for HORS are given, based on shape preserving transformations, and can be applied on actual programs without losing the structure of the program.
On rational trees
Arnaud Carayol,Christophe Morvan +1 more
- 25 Sep 2006
TL;DR: It is proved that first order theory is decidable for this family of rational trees, that is rational graphs which are trees, andCounter examples showing that this result cannot be significantly extended are presented.
16
References
•Book
Automata, Languages and Programming
Mike Paterson
- 01 Jan 1990
TL;DR: You can download and read online Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005 if you are registered here.
163
A generalized approach to formal languages
TL;DR: It is shown that the derivation trees of a context free set are always characterized by some recognizable set over a related many-sorted alphabet.
71
On the interpretation of recursive program schemes
Maurice Nivat
- 01 Jan 1974
TL;DR: A semantics for monadic recursive program schemes as rewriting systems which generate subsets of a free magma and defining a mapping of such subsets in a proper domain of functions is described.
•Proceedings Article
Langages algébriques sur le magma libre et sémantique des schémas de programme.
Maurice Nivat
- 01 Jan 1972
37
Related Papers (5)
Maurice Nivat
- 01 Jan 1974
Werner Damm
- 03 Sep 1979
Teodor Knapik,Damian Niwiński,Paweł Urzyczyn +2 more
- 08 Apr 2002
Michel Bidoit,Peter D. Mosses +1 more
- 01 Jan 2004