Computational reflection in PowerEpsilon

Authors:
Ming-Yuan Zhu
Affiliations:
Beijing Institute of Systems Engineering, P.O.Box 9702-19, Beijing 100101, People's Republic of China
Venue:
ACM SIGPLAN Notices
Year:
1994

Citing 8
Cited 0

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
Concepts and experiments in computational reflection

OOPSLA '87 Conference proceedings on Object-oriented programming systems, languages and applications
AUTO STAR—a software development system

ACM SIGPLAN Notices
Type checking with universes

TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Knowledge-Based Systems in Artificial Intelligence: 2 Case Studies

Knowledge-Based Systems in Artificial Intelligence: 2 Case Studies
Chunking in Soar: The Anatomy of a General Learning Mechanism

Machine Learning
Computational Reflection

GWAI '87 Proceedings of the 11th German Workshop on Artificial Intelligence
An Example of FOL Using Metatheory

Proceedings of the 6th Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reflective programming languages were introduced in order to study programs that need knowledge of their own behavior. In artificial intelligence, this kind of knowledge is heeded, for example, in programs that must explain their behavior to a user. In the study of programming languages, a similar phenomenon occurs in extensible languages, that is, languages in which one can write programs that change the language itself. In this paper, we present an investigation of computational reflection mechanism in a higher-order λ-calculus - PowerEpsilon. We will show that PowerEpsilon is an extremely rich and powerful language for reflective computation.