134 search results - page 8 / 27 » Higher-Order and Semantic Unification |
CIE
2010
Springer
14 years 5 days ago
2010
Springer
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
FSEN
2009
Springer
14 years 1 months ago
2009
Springer
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
TPHOL
2005
IEEE
14 years 28 days ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
ICFP
1997
ACM
13 years 11 months ago
1997
ACM
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...