Search results for "recursion schemes"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Jirí Adámek, Stefan Milius, Jiri Velebil	Semantics of Higher-Order Recursion Schemes.	CALCO	2009	DBLP DOI BibTeX RDF	infinite ?-terms, sets in context, rational tree, Higher-order recursion schemes
3	Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre	Collapsible Pushdown Automata and Recursion Schemes.	LICS	2008	DBLP DOI BibTeX RDF	Higher-order pushdown automata, game semantics, higher-order recursion schemes
2	Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno	Higher-order multi-parameter tree transducers and recursion schemes for program verification.	POPL	2010	DBLP DOI BibTeX RDF	higher-order tree transducers, tree-processing programs, program verification, higher-order recursion scheme
2	Christopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre	Recursion Schemes and Logical Reflection.	LICS	2010	DBLP DOI BibTeX RDF	Collapsible Pushdown Automata, Monadic Second Order Logic and Mu-Calculus Global model checking, Parity Games, Recursion Schemes
2	Naoki Kobayashi, C.-H. Luke Ong	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus.	ICALP	2009	DBLP DOI BibTeX RDF
2	Naoki Kobayashi	Types and higher-order recursion schemes for verification of higher-order programs.	POPL	2009	DBLP DOI BibTeX RDF	model checking, type system, higher-order recursion scheme
2	Naoki Kobayashi	Types and Recursion Schemes for Higher-Order Program Verification.	APLAS	2009	DBLP DOI BibTeX RDF
2	Naoki Kobayashi, C.-H. Luke Ong	A Type System Equivalent to the Modal Mu-Calculus Model Checking of Higher-Order Recursion Schemes.	LICS	2009	DBLP DOI BibTeX RDF
2	Christopher H. Broadbent, C.-H. Luke Ong	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.	FOSSACS	2009	DBLP DOI BibTeX RDF	Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme
2	Naoki Kobayashi	Model-checking higher-order functions.	PPDP	2009	DBLP DOI BibTeX RDF	model checking, program verification, higher-order functions, recursion schemes
2	Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre	Winning Regions of Higher-Order Pushdown Games.	LICS	2008	DBLP DOI BibTeX RDF	higher-order pushdown automata, mu-calculus model-checking, parity games, higher-order recursion schemes
2	C.-H. Luke Ong	Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.	MFCS	2007	DBLP DOI BibTeX RDF
2	C.-H. Luke Ong	On Model-Checking Trees Generated by Higher-Order Recursion Schemes.	LICS	2006	DBLP DOI BibTeX RDF
2	Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong	The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.	TLCA	2005	DBLP DOI BibTeX RDF
2	Hajime Ishihara	Function algebraic characterizations of the polytime functions.	Computational Complexity	1999	DBLP DOI BibTeX RDF	Polytime functions, function algebras, recursion schemes
2	Viktor K. Sabelfeld	The Tree Equivalence Problem for Linear Recursion Schemes.	Ershov Memorial Conference	1996	DBLP DOI BibTeX RDF
2	Jean H. Gallier	Recursion Schemes and Generalized Interpretations (Extended Abstract).	ICALP	1979	DBLP DOI BibTeX RDF
1	Axel Haddad	IO vs OI in Higher-Order Recursion Schemes	FICS	2012	DBLP DOI BibTeX RDF
1	Eric Badouel, Bernard Fotsing, Rodrigue Tchougong	Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers.	Electr. Notes Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Naoki Kobayashi, C.-H. Luke Ong	Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus	Logical Methods in Computer Science	2011	DBLP DOI BibTeX RDF
1	Jirí Adámek, Stefan Milius, Jiri Velebil	Semantics of Higher-Order Recursion Schemes	Logical Methods in Computer Science	2011	DBLP DOI BibTeX RDF
1	Naoki Kobayashi	A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes.	FOSSACS	2011	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Models of Higher-Order Computation: Recursion Schemes and Collapsible Pushdown Automata.	Logics and Languages for Reliability and Security	2010	DBLP DOI BibTeX RDF
1	Takeshi Tsukada, Naoki Kobayashi	Untyped Recursion Schemes and Infinite Intersection Types.	FOSSACS	2010	DBLP DOI BibTeX RDF
1	Norman Danner, James S. Royer	Two Algorithms in Search of a Type-System.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Higher-type computation, Higher-type complexity, Basic feasible functionals, Compositional semantics, Implicit computational complexity
1	Ralph Matthes	Recursion on Nested Datatypes in Dependent Type Theory.	CiE	2008	DBLP DOI BibTeX RDF
1	Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem	Recursion Schemata for NCk.	CSL	2008	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Verification of Higher-Order Computation: A Game-Semantic Approach.	ESOP	2008	DBLP DOI BibTeX RDF
1	Hua Yan, Ju Liu	Implementation Schemes of Regularization Super-Resolution Image Reconstruction.	SiPS	2007	DBLP DOI BibTeX RDF
1	Matthew Fluet, Riccardo Pucella	Practical Datatype Specializations with Phantom Types and Recursion Schemes.	Electr. Notes Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Jevgeni Kabanov, Varmo Vene	Recursion Schemes for Dynamic Programming.	MPC	2006	DBLP DOI BibTeX RDF
1	Colin Stirling	Second-Order Simple Grammars.	CONCUR	2006	DBLP DOI BibTeX RDF
1	Klaus Aehlig	A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.	CSL	2006	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract).	CSL	2006	DBLP DOI BibTeX RDF
1	Matthew Fluet, Riccardo Pucella	Practical Datatype Specializations with Phantom Types and Recursion Schemes	CoRR	2005	DBLP BibTeX RDF
1	Alberto Pardo	Combining Datatypes and Effects.	Advanced Functional Programming	2004	DBLP DOI BibTeX RDF
1	Andreas Abel, Ralph Matthes	Fixed Points of Type Constructors and Primitive Recursion.	CSL	2004	DBLP DOI BibTeX RDF
1	Lionel Elie Mamane	Surreal Numbers in Coq.	TYPES	2004	DBLP DOI BibTeX RDF
1	Peter Apostoli, Akira Kanda	Upper and Lower Recursion Schemes in Abstract Approximation Spaces.	RSFDGrC	2003	DBLP DOI BibTeX RDF
1	Egon Börger, Tommaso Bolognesi	Remarks on Turbo ASMs for Functional Equations and Recursion Schemes.	Abstract State Machines	2003	DBLP DOI BibTeX RDF
1	Isabel Oitavem	A term rewriting characterization of the functions computable in polynomial space.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
1	Tarmo Uustalu, Varmo Vene, Alberto Pardo	Recursion Schemes from Comonads.	Nord. J. Comput.	2001	DBLP BibTeX RDF
1	James L. Caldwell	Extracting General Recursive Program Schemes in Nuprl's Type Theory.	LOPSTR	2001	DBLP DOI BibTeX RDF
1	Viktor K. Sabelfeld	The tree equivalence of linear recursion schemes.	Theor. Comput. Sci.	2000	DBLP DOI BibTeX RDF
1	Martin Erwig	Random Access to Abstract Data Types.	AMAST	2000	DBLP DOI BibTeX RDF	adt, graph algorithm, category theory, catamorphism
1	Colin Stirling	Schema Revisited.	CSL	2000	DBLP DOI BibTeX RDF
1	Martín Hötzel Escardó, Thomas Streicher	Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras.	LICS	1997	DBLP DOI BibTeX RDF
1	David B. Benson, Irène Guessarian	Algebraic Solutions to Recursion Schemes.	J. Comput. Syst. Sci.	1987	DBLP DOI BibTeX RDF
1	Harry B. Hunt III, Daniel J. Rosenkrantz	Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze.	SIAM J. Comput.	1986	DBLP DOI BibTeX RDF
1	Harry B. Hunt III, Daniel J. Rosenkrantz	The Complexity of Monadic Recursion Schemes: Exponential Time Bounds.	J. Comput. Syst. Sci.	1984	DBLP DOI BibTeX RDF
1	Harry B. Hunt III, Daniel J. Rosenkrantz	The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications.	Theor. Comput. Sci.	1983	DBLP DOI BibTeX RDF
1	A. Ja. Dikovskii	A Theory of Complexity of Monadic Recursion Schemes.	ITA	1981	DBLP BibTeX RDF
1	Harry B. Hunt III, Daniel J. Rosenkrantz	The Complexity of Recursion Schemes and Recursive Programming Languages (Extended Abstract)	FOCS	1980	DBLP DOI BibTeX RDF
1	Nancy A. Lynch, Edward K. Blum	A Difference in Expressive Power Between Flowcharts and Recursion Schemes.	Mathematical Systems Theory	1979	DBLP DOI BibTeX RDF
1	Emily P. Friedman, Sheila A. Greibach	Monadic Recursion Schemes: The Effect of Constants.	J. Comput. Syst. Sci.	1979	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Simple Context-Free Languages and Free Monadic Recursion Schemes.	Mathematical Systems Theory	1977	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Equivalence Problems for Deterministic Context-Free Languages and Monadic Recursion Schemes.	J. Comput. Syst. Sci.	1977	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages	SWAT (FOCS)	1974	DBLP DOI BibTeX RDF
1	Stephen J. Garland, David C. Luckham	Program Schemes, Recursion Schemes, and Formal Languages.	J. Comput. Syst. Sci.	1973	DBLP DOI BibTeX RDF
1	Emily P. Friedman	Equivalence Problems in Monadic Recursion Schemes	SWAT (FOCS)	1973	DBLP DOI BibTeX RDF
1	James H. Morris Jr.	Recursion Schemes with Lists	STOC	1972	DBLP DOI BibTeX RDF