Theoretical Computer Science
Higher Order Unification 30 Years Later
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Finite Models and Full Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Fully Complete Minimal PER Models for the Simply Typed lambda-Calculus
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Higher-order unification and matching
Handbook of automated reasoning
Decidability of fourth-order matching
Mathematical Structures in Computer Science
Higher-order beta matching with solutions in long beta-eta normal form
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Model-Checking Games for Typed λ-Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Relative definability and models of unary PCF
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Verification of higher-order computation: a game-semantic approach
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
A game-theoretic approach to deciding higher-order matching
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A self-dependency constraint in the simply typed lambda calculus
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Higher-order matching and games
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
| Hi-index | 0.00 |