In praise of impredicativity: a contribution to the formalization of meta-programming
From MaRDI portal
Abstract: Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming, and meta-programs, as they are called in logic programming, are widespread declarative programming techniques. In logic programming, there is a gap between the meta-programming practice and its theory: The formalisations of meta-programming do not explicitly address its impredicativity and are not fully adequate. This article aims at overcoming this unsatisfactory situation by discussing the relevance of impredicativity to meta-programming, by revisiting former formalisations of meta-programming and by defining Reflective Predicate Logic, a conservative extension of first-order logic, which provides a simple formalisation of meta-programming.
Recommendations
Cites work
- A framework for defining logics
- A logical analysis of modules in logic programming
- A metalogic programming approach: language, semantics and applications
- A theory of type polymorphism in programming
- Combining negation as failure and embedded implications in logic programs
- Contributions to the Theory of Logic Programming
- Flow diagrams, turing machines and languages with only two formation rules
- Handbook of automated reasoning. In 2 vols
- Handbook of epistemic logic
- HiLog: A foundation for higher-order logic programming
- scientific article; zbMATH DE number 5838699 (Why is no real title available?)
- scientific article; zbMATH DE number 3904557 (Why is no real title available?)
- scientific article; zbMATH DE number 4075049 (Why is no real title available?)
- scientific article; zbMATH DE number 4096803 (Why is no real title available?)
- scientific article; zbMATH DE number 3181460 (Why is no real title available?)
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- scientific article; zbMATH DE number 3731310 (Why is no real title available?)
- scientific article; zbMATH DE number 43398 (Why is no real title available?)
- scientific article; zbMATH DE number 44472 (Why is no real title available?)
- scientific article; zbMATH DE number 65531 (Why is no real title available?)
- scientific article; zbMATH DE number 88995 (Why is no real title available?)
- scientific article; zbMATH DE number 3466489 (Why is no real title available?)
- scientific article; zbMATH DE number 978237 (Why is no real title available?)
- scientific article; zbMATH DE number 1552512 (Why is no real title available?)
- scientific article; zbMATH DE number 1926640 (Why is no real title available?)
- scientific article; zbMATH DE number 1841821 (Why is no real title available?)
- scientific article; zbMATH DE number 788036 (Why is no real title available?)
- scientific article; zbMATH DE number 788038 (Why is no real title available?)
- scientific article; zbMATH DE number 7526287 (Why is no real title available?)
- scientific article; zbMATH DE number 2188773 (Why is no real title available?)
- scientific article; zbMATH DE number 3349331 (Why is no real title available?)
- scientific article; zbMATH DE number 2212008 (Why is no real title available?)
- scientific article; zbMATH DE number 3020851 (Why is no real title available?)
- Languages with self-reference. I: Foundations (or: We can have everything in first-order logic!)
- Languages with self-reference. II: Knowledge, belief, and modality
- Letter to the Editor
- Modules for Prolog Revisited
- On the declarative and procedural semantics of definite metalogic programs
- On the logic of common belief and common knowledge
- On the undecidability of second-order unification
- One hundred years of Russell's paradox. Mathematics, logic, philosophy. Based on the Munich centenary conference, Munich, Germany, June 2001.
- Programming with higher-order logic.
- Prolegomena to a theory of mechanized formal reasoning
- Reflection principles in computational logic
- The Principal Type-Scheme of an Object in Combinatory Logic
- The Semantics of Predicate Logic as a Programming Language
- Types and programing languages
- Untersuchungen über das logische Schliessen. I
Cited in
(9)- MetaSoft primer. Towards a metalanguage for applied denotational semantics
- Imperative LF meta-programming
- On termination of meta-programs
- Why untyped nonground metaprogramming is not (much of) a problem
- scientific article; zbMATH DE number 1006087 (Why is no real title available?)
- scientific article; zbMATH DE number 2036328 (Why is no real title available?)
- Meta-predicate semantics
- scientific article; zbMATH DE number 7455734 (Why is no real title available?)
- An Asymptotic Analysis of Probabilistic Logic Programming, with Implications for Expressing Projective Families of Distributions
This page was built for publication: In praise of impredicativity: a contribution to the formalization of meta-programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5108530)
