- Higher Order beta Matching is Undecidable Ralph Loader Tue 19 February 2013
- Unary PCF is decidable Ralph Loader Tue 19 February 2013
- Higher-Order Matching and Games Colin Stirling Tue 19 February 2013
- A Game-Theoretic Approach to Deciding Higher-Order Matching Colin Stirling Tue 19 February 2013
- Higher-Order Matching, Games and Automata C. Stirling Tue 19 February 2013
- Decidability of All Minimal Models (Revised Version - 2012) Vincent Padovani Tue 19 February 2013
- Decidability of fourth-order matching Vincent Padovani Tue 19 February 2013
- Dependency Tree Automata Colin Stirling Tue 19 February 2013
- Decidability of higher-order matching Colin Stirling Tue 19 February 2013
- Decidability of all minimal models Vincent Padovani Tue 19 February 2013
- Ellipsis and higher-order unification Mary Dalrymple Stuart M. Shieber Fernando C. N. Pereira Tue 19 February 2013
- Lazy abstractions for timed automata Frédéric Herbreteau B. Srivathsan Igor Walukiewicz Tue 19 February 2013
- Higher-order rewrite systems and their confluence Richard Mayr Tobias Nipkow Mon 18 February 2013
- Building-in Equational Theories Gordon Plotkin Mon 18 February 2013
- Higher-Order Unification and Matching Gilles Dowek Mon 18 February 2013
- An intersection type system for deterministic pushdown automata Takeshi Tsukada Naoki Kobayashi Mon 18 February 2013
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes C. Ong Takeshi Tsukada Mon 18 February 2013
- Prelogical Relations Furio Honsell Donald Sannella Mon 18 February 2013
- Domain theory in logical form Samson Abramsky Mon 18 February 2013
- The Emptiness Problem for Intersection Types Pawel Urzyczyn Mon 18 February 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
