Emir Pasalic, Walid Taha, Tim Sheard  Home/Search
Context Related
| rice.edu/~taha/publications...icfp02.ps From: rice.edu/~taha/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of deriving an implementation that is both readable and efficient. In an untyped setting, staging an interpreter "removes a complete layer of interpretive overhead", just like partial evaluation. In a typed setting however, Hindley-Milner type systems do not allow us to exploit typing information in the language being... (Update)
Cited by: More
Statically Safe Program Generation with SafeGen - Huang, Zook, Smaragdakis (Correct)
A Methodology for Generating Verified Combinatorial Circuits - Kiselyov, Swadi, Taha (2004) (Correct)
Implicitly Heterogeneous Multi-Stage Programming - Eckhardt, Kaiabachev.. (2005) (Correct)
Similar documents (at the sentence level):
80.0%: Tagless Staged Interpreters for Typed Languages - Pasalic, Taha, Sheard (2002) (Correct)
Active bibliography (related documents): More All
0.6: Combining Programming Languages and Logical Reasoning Systems.. - Sheard (Correct)
0.5: A Bytecode-Compiled, Type-safe, Multi-Stage Language - Calcagno, Taha, Huang, Leroy (2001) (Correct)
0.4: Tag Elimination and Jones-Optimality (preliminary report) - Taha, Makholm, Hughes (2001) (Correct)
Similar documents based on text: More All
0.5: DALI: An Untyped CBV Operational Semantics and Equational.. - Pasalic, Sheard, Taha (Correct)
0.3: DALI: An Untyped, CBV Functional Language Supporting.. - Pasalic, Sheard, Taha (Correct)
0.2: Staged Notational Definitions - Walid Taha And (Correct)
Related documents from co-citation: More All
7: Dependent types in practical programming - Xi, Pfenning - 1999
6: Multi-Stage Programming: Its Theory and Applications - Taha - 1999
6: type-safe multi-stage programming language (context) - compiled - 2001
BibTeX entry: (Update)
Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for typed languages (formal development). Technical Report 02-006, OGI, 2002. Available from [33]. http://citeseer.ist.psu.edu/pasalic02tagless.html More
@misc{ pasalic02tagless,
author = "E. Pasalic and W. Taha and T. Sheard",
title = "Tagless staged interpreters for typed languages",
text = "Emir Pasalic, Walid Taha, and Tim Sheard. Tagless staged interpreters for
typed languages (formal development). Technical Report 02-006, OGI, 2002.
Available from [33].",
year = "2002",
url = "citeseer.ist.psu.edu/pasalic02tagless.html" }
Citations (may not include all citations):638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
434 A framework for defining logics - Harper, Honsell et al. - 1987
382 Lambda calculi with types - Barendregt - 1991
306 A syntactic approach to type soundness - Wright, Felleisen - 1994
210 Logic programming in the LF logical framework - Pfenning - 1991
197 Dependent types in practical programming - Xi, Pfenning - 1999
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1972
184 Definitional interpreters for higher-order programming langu.. (context) - Reynolds - 1998
152 Semantics of Programming Languages (context) - Gunter - 1992
143 A modal analysis of staged computation - Davies, Pfenning - 1996
133 Multi-stage programming with explicit annotations - Taha, Sheard - 1997
110 Eliminating array bound checking through dependent types - Xi, Pfenning - 1998
109 Programming in Martin-Lof's Type Theory (context) - Nordstrom, Peterson et al. - 1990
86 Intensional polymorphism in type-erasure semantics - Crary, Weirich et al. - 1998
84 Basic Category Theory for Computer Scientists (context) - Pierce - 1991
79 A type-based compiler for standard ML - Shao, Appel - 1995
70 Semantics of Programming Languages (context) - Tennent - 1991
65 Proving the correctness of reactive systems using sized type.. - Hughes, Pareto et al. - 1996
60 Flexible type analysis - Crary, Weirich - 1999
59 Multi-Stage Programming: Its Theory and Applications - Taha - 1999
55 Resource bound certification - Crary, Weirich - 2000
53 Multi-stage programming: Axiomatization and type-safety - Taha, Benaissa et al. - 1998
49 Inductive definitions in the system Coq: Rules and propertie.. - Paulin-Mohring - 1993
41 Inductive sets and families in Martin-Lof's type theory and .. - Dybjer - 1991
38 A sound reduction semantics for untyped CBN multi-stage comp.. - Taha - 2000
35 Formal Aspects of Computing (context) - Dybjer - 1994
32 DiSTiL: A transformation library for data structures - Smaragdakis, Batory - 1997
29 Modular domain specific languages and tools - Hudak - 1998
25 Building domain specific embedded languages - Hudak - 1996
25 A general formulation of simultaneous inductive-recursive de.. - Dybjer - 2000
23 A type system for certified binaries (context) - Shao, Saha et al. - 2002
22 Dynamic typing through staged type inference (context) - Shields, Sheard et al. - 1998
22 DSL implementation using staging and monads - Sheard, Benaissa et al. - 1999
22 LEAP: A language with eval and polymorphism (context) - Pfenning, Lee - 1989
18 Fully reflexive intensional type analysis - Trifonov, Saha et al. - 2000
16 Microlanguages for operating system specialization - Pu, Black et al. - 1997
16 type-safe multi-stage programming language (context) - compiled - 2001
15 Zine El-Abidine Benaissa - Moggi, Taha - 1999
13 Little languages (context) - Bentley - 1986
10 Tagless staged interpreters for typed languages - Pasalic, Taha et al. - 2002
10 Inherited limits (context) - Mogensen - 1999
8 Tag elimination and Jones-optimality - Taha, Makholm et al. - 2053
8 Bulletin of the European Association for Theoretical Compute.. (context) - Coquand, Nordstrom et al. - 1994
7 Inductive sets and families in MartinL of's type theory and .. (context) - Dybjer - 1990
6 Inductively defined sets in Martin-Lof's set theory (context) - Dybjer - 1987
6 Directions in functional programming for real (context) - Taha, Hudak et al. - 2001
5 and Implementation of Program Generation (context) - Taha, Semantics - 1924
5 On Jones-optimal specialization for strongly typed languages (context) - Makholm - 2000
5 Programming in constructive set theory: Some examples (context) - Nordstrom - 1981
4 A tutorial on recursive types in Coq - Gimenez - 1998
3 Tag elimination -- or -- type specialisation is a type-index.. - Taha, Makholm - 2000
3 An exercise in dependent types: A well-typed interpreter - Augustsson, Carlsson - 1999
2 Finite axiomatizations of inductive and inductive-recursive .. - Dybjer, Setzer - 1998
2 Compiling polymorphism using intentional type analysis (context) - Harper, Morrisett - 1995
2 A practical implementation of tag elimination (context) - Huang, Taha
1 Laboratoire de l'Informatique du Parallelisme (context) - Institute, Reports et al. - 1992
1 Unpublished manuscript available online from author's homepa.. (context) - Cardelli, in - 1988
http://www.cs.chalmers.se/
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rice.edu/~taha/publications.html): More
Resource-Aware Programming - Taha (Correct)
Logical Modalities and Multi-Stage Programming - Zine El-Abidine Benaissa (1999) (Correct)
Tag Elimination and Jones-Optimality (includes proofs) - Taha, Makholm, Hughes (Correct)
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