(Enter summary)
Abstract: data types are facilitated in
Godel by its type and module systems. Thus, in order to describe the
meta-programming facilities of Godel, a brief account of these systems is
given.
Each constant, function, predicate, and proposition in a Godel program
must be specified by a language declaration. The type of a variable is
not declared but inferred from its context within a particular program
statement. To illustrate the type system, we give the language declarations
that would be required for... (Update)
Context of citations to this paper: More
...variables are not allowed. In the literature there are several proposals of higher order logic languages (see, for instance, [6,7,10]) However, the main contribution of this paper is not the design of a new higher order language, but the use of some higher order...
Cited by: More
On Termination of Meta-Programs - Serebrenik, De Schreye (2001)
(Correct)
Generalization in Hierarchies of Online Program.. - Glück, Hatcliff..
(Correct)
A Foundation for Metareasoning Part I: The Proof Theory - Criscuolo, Giunchiglia.. (2002)
(Correct)
Active bibliography (related documents): More All
1.4: Metaprogramming in Logic - Barklund (1994)
(Correct)
0.8: Meta-reasoning: a Survey - Costantini (2002)
(Correct)
0.7: Abstract Metaprolog Engine - Cicekli (1994)
(Correct)
Similar documents based on text: More All
0.3: Meta-Programming with Names and Necessity - Nanevski, Pfenning (2002)
(Correct)
0.2: Controlling Generalization and Polyvariance in Partial .. - Leuschel, Martens, De .. (1998)
(Correct)
0.2: Regular Trees as an Abstract Domain for Program Specialisation - Gallagher, al. (2000)
(Correct)
Related documents from co-citation: More All
10: The Godel Programming Language (context) - Hill, Lloyd - 1994
9: Foundations of Logic Programming (context) - Lloyd - 1987
8: The Art of Prolog (context) - Sterling, Shapiro - 1986
BibTeX entry: (Update)
P.M. Hill and J. Gallagher. Meta-Programming in Logic Programming. In Artificial Intelligence and Logic Programming. Oxford University Press, 1994. http://citeseer.ist.psu.edu/228572.html More
@book{ hill94metaprogramming,
author = "P. M. Hill and J. G. Gallagher",
title = "Meta-Programming in Logic Programming",
publisher = "School of Computer Studies, University of Leeds",
address = "Leeds",
isbn = "1575862379",
year = "1994",
url = "citeseer.ist.psu.edu/228572.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987
759
Negation as failure (context) - Clark - 1978
440
The Art of Prolog (context) - Sterling, Shapiro - 1986
328
Algorithmic Program Debugging (context) - Shapiro - 1982
224
Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
179
The Godel Programming Language (context) - Hill, Lloyd - 1994
139
fold transformations of logic programs (context) - Tamaki, Sato - 1984
112
Partial evaluation of computation process - an approach to a..
- Futamura - 1971
101
HiLog: A foundation for higher-order logic programming
- Chen, Kifer et al. - 1993
86
Amalgamating language and metalanguage in logic programming (context) - Bowen, Kowalski - 1982
68
Uber formal unentscheidbare Satze der Principia Mathematica .. (context) - Godel - 1931
42
Problems and promises of computational logic (context) - Kowalski - 1990
39
Partial evaluation as a means for inferencing data structure.. (context) - Komorowski - 1982
31
Partial evaluation of Prolog programs and its application to.. (context) - Takeuchi, Furukawa - 1986
30
Some low-level source transformations for logic programs
- Gallagher, Bruynooghe - 1990
29
Composition operators for logic theories (context) - Brogi, Mancarella et al. - 1990
28
Fold Transformation of Stratified Programs (context) - Seki - 1989
26
Why untyped non-ground metaprogramming is not (context) - Martens, De Schreye
25
A metalogic programming language (context) - Costantini, Lanzarone - 1989
24
Transfinite recursive progressions of axiomatic theories (context) - Feferman - 1962
24
fold transformations of logic programs (context) - Gardner, Shepherdson - 1991
23
How to invent a Prolog machine (context) - Kursawe - 1987
21
Metainterpreters for expert system construction (context) - Sterling, Beer - 1989
20
Meta interpreters for real (context) - Safra, Shapiro - 1986
19
The control facilities of IC-PROLOG (context) - Clark, McCabe - 1979
17
The structure of a self-applicable partial evaluator (context) - Sestoft, Jones - 1988
17
Metaprogramming in logic
- Barklund - 1994
16
The applicability of logic program analysis and transformati..
- De Waal, Gallagher - 1994
15
Specialisation of logic programs: A tutorial (context) - Gallagher - 1993
14
Towards a methodology for the design of abstract machines fo.. (context) - Nilsson - 1993
12
Meta for modularising logic programming (context) - Brogi, Mancarella et al. - 1992
12
A meta-level extension of Prolog (context) - Bowen, Weinberg - 1985
11
A self-applicable partial evaluator and its use in increment.. (context) - Fujita, Furukawa - 1988
11
Definable naming relations in metalevel systems
- Harmelen - 1992
11
Transforming logic programs by specialising interpreters (context) - Gallagher - 1986
9
An application of amalgamated logic to multi-agent belief (context) - Kim, Kowalski - 1990
9
A basis for a multilevel metalogic programming language
- Barklund, Boberg et al. - 1994
9
Reasoning about knowledge and ignorance (context) - Aiello, Nardi et al. - 1988
8
Mathematical Logic (context) - Quine - 1951
8
Logic without model theory
- Kowalski - 1993
8
A perfect Herbrand semantics for untyped vanilla meta-progra.. (context) - Martens, De Schreye
8
Ambivalent logic as the semantic basis of metalogic programm.. (context) - Jiang - 1994
7
the specialization of online program specializers
- Ruf, Weise - 1993
5
Semantics of a metalogic programming language (context) - Costantini - 1990
4
Incremental flavor-mixing of metainterpreters for expert sys.. (context) - Sterling, Beer - 1986
4
Compiling control (context) - Bruynooghe, De Schreye et al. - 1989
4
Hierarchical representation of legal knowledge with meta-pro.. (context) - Barklund, Hamfelt - 1994
3
multiple worlds (context) - Levi, Sardu et al. - 1988
3
Meta-programming for dynamic knowledge bases (context) - Hill, Lloyd - 1988
3
An example of FOL using Metatheory (context) - Weyhrauch - 1982
2
A point of self-reference (context) - Richards - 1974
2
Logic programming with ions (context) - Abdallah - 1987
2
Construction of logic programs based on generalised unfold/f.. (context) - Kanamori, Horiuchi - 1987
1
Partial Evaluation and Automatic Software Generation (context) - Jones, Gomard et al. - 1993
1
User's guide to DECsystem-10 Prolog (context) - Pereira, Pereira et al. - 1978
1
An architecture with multiple meta-levels for the developmen.. (context) - Dunin-Keplicz - 1994
1
Meta-languages (context) - Perlis, Subrahmanian - 1994
1
On proof predicates in logic programming (context) - Christiansen - 1994
1
Prolegomena to a theory of mechanised formal reasoning (context) - Weyhrauch - 1980
1
A Self-Applicable Partial Evaluator for the Logic Programmin.. (context) - in, Gurr - 1993
1
es de communication homme-machine en fran¸cais, Technical re.. (context) - Colmerauer, Kanoui et al. - 1973
1
Negation as failure: Completion and stratification (context) - Shepherdson - 1994
The graph only includes citing articles where the year of publication is known.
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