Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf
$\lambda$Prolog is known to be well-suited for expressing and implementing logics and inference systems. We show that lemmas and definitions in such logics can be implemented with a great economy of expression. We encode a higher-order logic using an encoding that maps both terms and types of the ob...
Uloženo v:
| Vydáno v: | Theory and practice of logic programming Ročník 4; číslo 1-2; s. 1 - 39 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Cambridge, UK
Cambridge University Press
01.01.2004
|
| Témata: | |
| ISSN: | 1471-0684, 1475-3081 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | $\lambda$Prolog is known
to be well-suited for expressing and implementing logics and
inference systems. We show that lemmas and definitions in such
logics can be implemented with a great economy of expression. We
encode a higher-order logic using an encoding that maps both terms
and types of the object logic (higher-order logic) to terms of the
metalanguage ($\lambda$Prolog). We discuss both the Terzo and
Teyjus implementations of $\lambda$Prolog. We also encode the same logic
in Twelf and compare the features of these two metalanguages for our
purposes. |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 1471-0684 1475-3081 |
| DOI: | 10.1017/S1471068403001698 |