Meta Programming in Prolog

pages

English

Documents

Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

Découvre YouScribe en t'inscrivant gratuitement

Je m'inscris

pages

English

Ebook

Lire un extrait

Obtenez un accès à la bibliothèque pour le consulter en ligne En savoir plus

Publié par

chaeh

Nombre de lectures

Langue

English

Niveau: Supérieur
Meta-Programming in ?Prolog UKALP meeting, Edinburgh, 10 April 1991 Dale Miller University of Edinburgh and University of Pennsylvania Abstract Meta-programming generally requires the manipulation of data objects that contain internal abstractions. For examples, formulas contain quantification and programs contain parameters and local scopes. First-order terms are not well suited for implementing such structures since the central notions of scope, substitution, and bound and free variable occurrences are not directly supported and must be implemented by a programmer. Such implementations are often difficult to get correct and seldom form a clean interface with other parts of a larger system. Since ?Prolog replaces first-order terms with ?-terms it offers a new approach to meta-programming. In this tutorial, I will present the basic principles of ?Prolog that make it suitable for meta-programming. Several examples from theorem proving and program transformation will be presented. Familiarity with ?Prolog will not be assumed. slides/ukalp 1

relationship

bound variable

such implementations

abstract syntax

programming

implementing such

order

structures since

meta-programming generally

get correct

Voir

Publié par

chaeh

Nombre de lectures

Langue

English

Meta-Programming in λ Prolog

UKALP meeting, Edinburgh, 10 April 1991

Dale Miller dmi@lfcs.ed.ac.uk University of Edinburgh and University of Pennsylvania

Abstract Meta-programming generally requires the manipulation of data objects that contain internal abstractions. For examples, formulas contain quantication and programs contain parameters and local scopes. First-order terms are not well suited for implementing such structures since the central notions of scope, substitution, and bound and free variable occurrences are not directly supported and must be implemented by a programmer. Such implementations are often dicult to get correct and seldom form a clean interface with other parts of a larger system. Since λ Prolog replaces rst-order terms with λ -terms it oers a new approach to meta-programming. In this tutorial, I will present the basic principles of λ Prolog that make it suitable for meta-programming. Several examples from theorem proving and program transformation will be presented. Familiarity with λ Prolog will not be assumed.

slides/ukalp 1

Voir