Chuck C. Liang. Compiler construction in higher order logic programming. In Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 47-63, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Formal Compiler Implementation in a Logical Framework - Hickey, Nogin, Granicz.. (2003) (Correct)
....conditional or unconditional, and are applied until a normal form is reached. Using equations, programmers can specify optimizations, program transformations, and evaluation. The ASF SDF system targets the generation of informal rewriting code that can be used in a compiler implementation. Liang [10] implemented a compiler for a simple imperative language using a higher order abstract syntax implementation in Prolog. Liang s approach includes several of the phases we describe here, including parsing, CPS conversion, and code generation using a instruction set de ned using higherabstract ....
Chuck C. Liang. Compiler construction in higher order logic programming. In Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 47-63, 2002.
Formal Compiler Implementation in a Logical Framework - Hickey, Nogin, Granicz.. (2003) (Correct)
....conditional or unconditional, and are applied until a normal form is reached. Using equations, programmers can specify optimizations, program transformations, and evaluation. The ASF SDF system targets the generation of informal rewriting code that can be used in a compiler implementation. Liang [10] implemented a compiler for a simple imperative language using a higher order abstract syntax implementation in Prolog. Liang s approach includes several of the phases we describe here, including parsing, CPS conversion, and code generation using a instruction set de ned using higher abstract ....
C. C. Liang. Compiler construction in higher order logic programming. In Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 47-63, 2002.
Tradeoffs in the Intensional Representation of Lambda Terms - Liang, Nadathur Self-citation (Liang) (Correct)
....of a redex is always a constant and a restricted form of higher order uni cation [12] We test the following programs in this category: typeinf ] A program that infers type schemes for ML like programs based on the Damas Milner system. compiler] A compiler for a small imperative language [11]. Unrestricted Programs. Programs in this class make essential use of (general) higher order uni cation. As such, they tend to involve signi cant backtracking and they also encompass reduction where the arguments of redexes are complex terms. The programs tested in this category are the ....
C. Liang. Compiler construction in higher order logic programming. In 4th International Symposium on Practical Aspects of Declarative Languages, pages 47-63. Springer Verlag LNCS No. 2257, 2002.
Compiler Implementation in a Formal Logical Framework - Hickey, Nogin, Granicz.. (2003) (Correct)
No context found.
Chuck C. Liang. Compiler construction in higher order logic programming. In Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 47-63, 2002.
Formal Compiler Implementation in a Logical Framework - Hickey, Nogin, Granicz.. (2003) (Correct)
No context found.
Chuck C. Liang. Compiler construction in higher order logic programming. In Practical Aspects of Declarative Languages, volume 2257 of Lecture Notes in Computer Science, pages 47--63, 2002.
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