Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001), number 2215 in Lecture Notes in Computer Science, pages 243--262. Springer-Verlag, 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Nominal Logic, A First Order Theory of Names and Binding - Pitts (2002) (10 citations) (Correct)
.... They are also a necessary precursor for the study of the computational properties of the logic of freshness: work is in progress on a version of rst order logic programming extended with Nominal Logic s primitives of swapping and freshness of atoms (cf. Hamana s logic programming language [21] based on the presheaf semantics of binding in [11] However, if one wants a single, expressive foundational theory in which to de25 velop the mathematics of syntax in the style of this paper, one can use FM set theory (and its automated support within Isabelle) or, as Gabbay argues in [14] a ....
M. Hamana. A logic programming language based on binding algebras. In N. Kobayashi and B. C. Pierce, editors, Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001.
Nominal Unification - Urban, Pitts, Gabbay (2003) (5 citations) (Correct)
....application, capture avoiding substitution and ## equivalence. Does it have to be so No For one thing, several authors have already noted that one can make sense of possibly capturing substitution modulo # equivalence by using explicit substitutions in the term representation language: see [6, 12, 14, 27]. Compared with those works, we make a number of simplifications. First, we find that we do not need to use function variables, application or ## equivalence in our representation language leaving just binders and # equivalence. Secondly, instead of using explicit substitutions of names for ....
....terms one wants to unify (although in L # only a very weak form of # conversion is necessary Miller calls it # 0 conversion namely (#x.M)y = M [y x] with y a variable) This requirement is annoying for languages, such as the # calculus, in which # reduction is not a primitive notion. Hamana [12, 13] manages to add possibly capturing substitution to a language like Miller s L # . This is achieved by adding syntax for explicit renaming operations and by recording implicit dependencies of variables upon bindable names in a typing context. The mathematical foundation for Hamana s system is the ....
M. Hamana. A logic programming language based on binding algebras. In N. Kobayashi and B. C. Pierce, editors, Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001.
αProlog: A Logic Programming Language with Names.. - Cheney, Urban (Correct)
No context found.
Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001), number 2215 in Lecture Notes in Computer Science, pages 243--262. Springer-Verlag, 2001.
Relating Nominal and Higher-Order Pattern Unification - Cheney (Correct)
No context found.
Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001), number 2215 in Lecture Notes in Computer Science, pages 243--262. Springer-Verlag, 2001.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001.
Nominal Unification - Urban, Pitts, Gabbay (2004) (5 citations) (Correct)
No context found.
M. Hamana, A logic programming language based on binding algebras, in: N. Kobayashi, B. C. Pierce (Eds.), Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001.
Alpha-Prolog: A Logic Programming Language with Names.. - Cheney, Urban (2004) (Correct)
No context found.
Makoto Hamana. A logic programming language based on binding algebras. In Proc. Theoretical Aspects of Computer Science (TACS 2001), number 2215 in Lecture Notes in Computer Science, pages 243--262. Springer-Verlag, 2001.
Nominal Unification - Christian Urban Andrew (2003) (5 citations) (Correct)
No context found.
M. Hamana, A logic programming language based on binding algebras, in: N. Kobayashi, B. C. Pierce (Eds.), Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC