Results 1 
4 of
4
Currying secondorder unification problems
 In: Proc. of the 13th International Conference on Rewriting Techniques and Applications. RTA’02. In: LNCS
, 2002
"... Abstract. The Curry form of a term, like f(a, b), allows us to write it, using just a single binary function symbol, as @(@(f,a),b). Using this technique we prove that the signature is not relevant in secondorder unification, and conclude that one binary symbol is enough. By currying variable appli ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
Abstract. The Curry form of a term, like f(a, b), allows us to write it, using just a single binary function symbol, as @(@(f,a),b). Using this technique we prove that the signature is not relevant in secondorder unification, and conclude that one binary symbol is enough. By currying variable applications, like X(a), as
Contextual Model Type Theory
, 2005
"... this paper we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its typetheoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding metavariables and explicit substitutio ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
this paper we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its typetheoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding metavariables and explicit substitutions. We sketch some applications in functional programming and logical frameworks
Simplifying the signature in secondorder unification
, 2009
"... SecondOrder Unification is undecidable even for very specialized fragments. The signature plays a crucial role in these fragments. If all symbols are monadic, then the problem is NPcomplete, whereas it is enough to have just one binary constant to lose decidability. In this work we reduce SecondO ..."
Abstract
 Add to MetaCart
SecondOrder Unification is undecidable even for very specialized fragments. The signature plays a crucial role in these fragments. If all symbols are monadic, then the problem is NPcomplete, whereas it is enough to have just one binary constant to lose decidability. In this work we reduce SecondOrder Unification to SecondOrder Unification with a signature that contains just one binary function symbol and constants. The reduction is based on partially currying the equations by using the binary function symbol for explicit application @. Our work simplifies the study of SecondOrder Unification and some of its variants, like Context Unification and Bounded SecondOrder Unification.
unknown title
"... The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this paper we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its typetheoretic analogue. Contextual modal type t ..."
Abstract
 Add to MetaCart
The intuitionistic modal logic of necessity is based on the judgmental notion of categorical truth. In this paper we investigate the consequences of relativizing these concepts to explicitly specified contexts. We obtain contextual modal logic and its typetheoretic analogue. Contextual modal type theory provides an elegant, uniform foundation for understanding metavariables and explicit substitutions. We sketch some applications in functional programming and logical frameworks.