Dale Miller. Abstract syntax for variable binders: an overview. In John Lloyd et al., editor, Computational Logic - CL 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Compiler Construction in Higher Order Logic Programming - Liang (2002) (4 citations) (Correct)
....logic programming is still not used as a general tool in compiler construction. Implementations of compilers still rely principally on imperative languages, which are less capable of exploiting the inherently declarative aspects of compilation. In particular, higher order abstract syntax [27, 38], a technique that uses terms in the representation of programs, has been shown to be a valuable tool in the declarative analysis and transformation of programs. This new form of abstract syntax however, is still not applied to practical compiler construction. Studies of higher order abstract ....
....including compiler veri cation [15] The justi cation of our preference for Prolog lies primarily in the availability of a high performance implementation, which is discussed in Sections 3 and 9. For more information on Prolog and higher order abstract syntax, the reader is asked to consult [27, 31]. 3 Obstacles to Application From the beginning, work in higher order abstract syntax have pointed in the direction of its application in compiler writing. It has been known for some time, for example, that HOAS can give declarative formulations of type checking. Other works include using HOAS ....
D. Miller. Abstract syntax for variable binders: An overview. In Computational Logic - CL
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) Self-citation (Miller) (Correct)
No context found.
D. Miller. Abstract syntax for variable binders: An overview. In J. Lloyd and et. al., editors, Computational Logic - CL 2000.
Reasoning About Logic Programs Using Definitions And Induction - Wajs (2002) (2 citations) Self-citation (Miller) (Correct)
No context found.
Dale Miller. Abstract syntax for variable binders: An overview. In J. Lloyd et al., editors, Proceedings of the First International Conference on Computational Logic --- CL 2000.
A Proof Search Specification of the π-Calculus - Tiu, Miller Self-citation (Miller) (Correct)
No context found.
D. Miller. Abstract syntax for variable binders: An overview. In J. Lloyd and et. al., editors, Computational Logic - CL 2000, number 1861 in LNAI, pages 239--253. Springer, 2000.
A Proof Search Specification of the π-Calculus - Tiu, Miller (2004) Self-citation (Miller) (Correct)
No context found.
D. Miller. Abstract syntax for variable binders: An overview. In J. Lloyd and et. al., editors, Computational Logic - CL 2000, number 1861 in LNAI, pages 239--253. Springer, 2000.
Using Linear Logic to Reason About Sequent - Systems Dale Miller Self-citation (Miller) (Correct)
No context found.
Dale Miller. Abstract syntax for variable binders: An overview. In John Lloyd and et. al., editors, Computational Logic - CL 2000, number 1861 in LNAI, pages 239--253. Springer, 2000.
Encoding Generic Judgments - Miller, Tiu (2002) (3 citations) Self-citation (Miller) (Correct)
....to encode a syntactic category of abstraction by placing it within a rich function spaces can cause significant problems (undecidable unification, exotic terms, etc) that might seem rather inappropriate if one is only trying to develop a simple treatment of syntax. The notion of # tree syntax [MP99,Mil00] was introduced to work around these complexities. Here, # abstractions are not general functions: they can only be applied to other, internally bound variables. Substitution of general values is not part of the equality theory in the # term syntax approach: it must be coded as 4 a separate ....
Dale Miller. Abstract syntax for variable binders: An overview. In John Lloyd and et. al., editors, Computational Logic - CL 2000, number 1861 in LNAI, pages 239--253. Springer, 2000.
Toward a General Theory of Names, Binding and Scope - James Cheney University (Correct)
No context found.
Dale Miller. Abstract syntax for variable binders: an overview. In John Lloyd et al., editor, Computational Logic - CL 2000.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
Dale Miller. Abstract syntax for variable binders: an overview. In John Lloyd et al., editor, Computational Logic - CL 2000.
A Rule-Based Language for Programming Software Updates - Martin Erwig Erwig (2002) (Correct)
No context found.
D. Miller. Abstract Syntax for Variable Binders: An Overview. In Computational Logic, LNAI 1861, pages 239-- 253, 2000.
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