Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In ACM Symposium on Principles of Programming Languages, January 1996. To appear. An earlier version is available as Technical Report CMU--CS--95--145, School of Computer Science, Carnegie Mellon University.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Phantom Types - Cheney, Hinze (2003) (1 citation) (Correct)
....such as Haskell or Standard ML. Past approaches have included adding a rst class Dynamic type and typecase expressions [1, 2, 19] de ning generic functions by translation from polytypic languages to existing languages [15, 13] and implementing staged computation with run time type checking [8, 23] or compile time computation [22] Recently, Cheney and Hinze [6] and Baars and Swierstra [4] found that many of these features can already be implemented via an encoding into Haskell based on equality types comprising proofs of type equality. However, this encoding has several drawbacks: It ....
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-604, May 2001.
Accomplishments and Research Challenges in Meta-Programming - Sheard (2000) (16 citations) (Correct)
....study un typed, multi stage languages in the context of binding time analysis for offline partial evaluation. Important, early formal investigations into lanuages for staging computation were carried out by Rowan Davies and Frank Pfenning. They studied the typed multi stage languages MiniML O [20] and MiniML [19] These languages explore type systems (and find connections to intuitionistic modal logic, and linear time constructive modal logic) for languages with type constructors for code. An important work relating these areas is the thesis of Walid Taha [74] His thesis explains the ....
....and when it will (finally) be fully compiled. Fabius. Fabius [42 44] is a compiler for a staged language. Fabius uses explicit annotations to stage a program in an ML like language. The staging annotations of Fabius are based upon the type systems devised by Frank Pfenning and Rowan Davies [20, 19]. Other than MetaML, Fabius is the only dynamic code generator that types object level code. The UW Dynamic Compilation Project. DyC [34,6,35] is a C based dynamic compilation system. In DyC regions of code are marked for specialization, and variables in those regions are declared either ....
R. Davies and F. Pfenning. A modal analysis of staged computation. In 3rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 258-270, St. Petersburg Beach, Jan. 1996.
Runtime Code Generation with JVM And CLR - Sestoft (2002) (Correct)
....guarantee at Java or C# compiletime that the generated bytecode will pass the verifier. Although the JVM or CLR verifier will catch all code errors, it is far better to have a static guarantee that the generated code will be verifiable. Previous relevant work includes that by Davies and Pfenning [17], and the type systems of MetaOCaml [10] and DynJava [31] Acknowledgements: Martin Elsman suggested looking at encryption algorithms for a case study, and provided comments on a draft. Thanks also to Kasper sterbye, Ken Friis Larsen, and Niels Jrgen Kokholm for pointers and suggestions. ....
R. Davies and F. Pfenning. A modal analysis of staged computation. In 23rd Principles of Programming Languages, St Petersburg Beach, Florida, pages 258--270. ACM Press, 1996.
Categorical and Kripke Semantics for Constructive S4.. - Alechina, Mendler, de .. (2001) (4 citations) (Correct)
....we take a fresh look at two prominent constructive modal extensions to intuitionistic propositional logic (IPL) which are particularly interesting because of their various applications in computer science. To give the reader a taste for these applications, we list a few. Davies and Pfenning [DP96] use the # modality to give a # calculus for computation in stages. The idea is that a term #t represents a delayed computation. Ghani et al. GdPR98] investigate refinements of this calculus which are suitable for the design of abstract machines. Similar ideas relating # with staged evaluation ....
R. Davies and F. Pfenning. A modal analysis of staged computation. In Guy Steele, Jr., editor, Proc. of 23rd POPL, pages 258--270. ACM Press, 1996.
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005) Self-citation (Pfenning) (Correct)
No context found.
Davies, R. and Pfenning, F. 2001. A modal analysis of staged computation. Journal of the ACM 48, 3 (May), 555--604.
Electronic Notes in Computer Science 1 (1995) - On Modal Calculus (1995) (4 citations) Self-citation (Pfenning) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Submitted, February 1995. 22
A Modal Analysis of Staged Computation - Rowan Davies And (1996) (124 citations) Self-citation (Davies Pfenning) (Correct)
No context found.
Davies, R. and Pfenning, F. 1996. A modal analysis of staged computation. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96) (Jan. 1996), pp. 258--270.
Staged Computation with Names and Necessity - Nanevski, Pfenning (2005) Self-citation (Frank) (Correct)
No context found.
Davies, Rowan, & Pfenning, Frank. (2001). A modal analysis of staged computation. Journal of the ACM, 48(3), 555--604.
Modal Typing for Specifying Run-time Code Generation - Washburn (2001) Self-citation (Pfenning) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A Modal Analysis of Staged Computation. Conference Record of POPL '96: The 23 ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 258-270. January 1996.
Type Refinements - Harper, Pfenning (2001) Self-citation (Pfenning) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Guy Steele, Jr., editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258--270, St. Petersburg Beach, Florida, January 1996. ACM Press.
A Modal Analysis of Staged Computation - Rowan Davies And (1999) (124 citations) Self-citation (Davies Pfenning) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Proceedings of the 23rd Annual ACM Symposium on Principles of Programming Languages, pages 258--270, January 1996.
Optimizing ML with Run-Time Code Generation - Detex Paper Wc (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In ACM Symposium on Principles of Programming Languages, January 1996. To appear. An earlier version is available as Technical Report CMU--CS--95--145, School of Computer Science, Carnegie Mellon University.
Under consideration for publication in Math. Struct. in .. - Judgmental.. (Correct)
No context found.
Davies, R. and Pfenning, F. (2000). A modal analysis of staged computation. Journal of the ACM. To appear. Preliminary version available as Technical Report CMU-CS-99-153, August 1999.
Under consideration for publication in Math. Struct. in .. - Judgmental.. (Correct)
No context found.
Davies, R. and Pfenning, F. (1996). A modal analysis of staged computation. In Steele, Jr., G., editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258--270, St. Petersburg Beach, Florida. ACM Press.
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
Modal Logics with Existential Modality, Finite-iteration.. - Shkatov (2005) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. In Guy Steele, Jr., editor, Proc. of 23rd POPL, pages 258--270. ACM Press, 1996.
A Modal Language for the Safety of Mobile Values - Park (2005) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-- 604, 2001.
An Idealized MetaML: Simpler, and More Expressive - Moggi, Taha, Benaissa, Sheard (1999) (2 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), St.Petersburg Beach, Florida, January 1996.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555-604, 2001.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96), pages 258-270, St. Petersburg Beach, 1996.
Tagless Staged Interpreters for Typed Languages - Pasalic, Taha, Sheard (2002) (3 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96), pages 258--270, St. Petersburg Beach, 1996.
Generating Heap-bounded Programs in a - Functional Setting Walid (Correct)
No context found.
Davies, R., and Pfenning, F. A modal analysis of staged computation. Journal of the ACM 48, 3 (2001), 555--604.
Guarded Recursive Datatype Constructors - Xi, Chen, Chen (2003) (8 citations) (Correct)
No context found.
R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. Journal of ACM, 2002.
Closed Types as a Simple Approach to Safe Imperative.. - Calcagno, Moggi, Taha (2000) (4 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 258--270, St. Petersburg Beach, January 1996.
Generating Heap-bounded Programs in a - Functional Setting Walid (2003) (Correct)
No context found.
Davies, R., and Pfenning, F. A modal analysis of staged computation. Journal of the ACM 48, 3 (2001), 555--604.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R., and Pfenning, F. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96) (St. Petersburg Beach, 1996), pp. 258--270.
Nominal Logic Programming - Cheney (2004) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (4 citations) (Correct)
No context found.
R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. Journal of ACM, 48(3):555--604, 2001.
Metatheoretic Results for a Modal λ-Calculus - Despeyroux, Leleu (2000) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Guy Steele Jr., editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258-270, St. Petersburg Beach, Florida, January 1996. ACM Press.
Recursion over Objects of Functional Type - Despeyroux, Leleu (2000) (5 citations) (Correct)
No context found.
Davies, R. and Pfenning, F. (1996). A modal analysis of staged computation. In Guy Steele, J., editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258-270, St. Petersburg Beach, Florida. ACM Press.
A Modal Lambda Calculus with Iteration and Case Constructs - Despeyroux, Leleu (1998) (4 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Jr. Guy Steele, editor, Proceedings of the 23rd Annual Symposium on Principles of Programming Languages, pages 258270, St. Petersburg Beach, Florida, January 1996. ACM Press. 14
An Automatic Program Generator for Multi-Level Specialization - Glück, Jørgensen (1997) (2 citations) (Correct)
No context found.
Davies, R. and Pfenning, F. A modal analysis of staged computation. In Symposium on Principles of Programming Languages. ACM Press, pp. 258--270, 1996.
A Fresh Calculus for Name Management - Ancona, Moggi (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
A Lightweight Implementation of Generics and Dynamics - Cheney, Hinze (2002) (13 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, May 2001.
Multi-Stage Programming - Walid Taha Tim (1997) (5 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), St.Petersburg Beach, Florida, January 1996.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96), pages 258--270, St. Petersburg Beach, 1996.
Quasiquotation in Lisp - Alan Bawden Bawden (1999) (16 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In Proc. Symposium on Principles of Programming Languages, pages 258-283. ACM, January 1996.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R., and Pfenning, F. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96) (St. Petersburg Beach, 1996), pp. 258--270.
A Modal Calculus for Effect Handling - Nanevski (2003) (1 citation) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
A Calculus for Symbolic Names Management - Ancona, Moggi (2003) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3):555--604, 2001.
Binding-Time Analysis for MetaML via Type Inference and.. - Linger, Sheard (2004) (1 citation) (Correct)
No context found.
Davies, R., Pfenning, F.: A modal analysis of staged computation. In: Conf. Record 23rd ACM SIGPLAN/SIGACT Symp. on Principles of Programming Languages, POPL'96, St. Petersburg Beach, FL, USA, 21-24 Jan 1996. ACM Press, New York (1996) 258-270
Multi-Stage Imperative Languages: A Conservative Extension.. - Calcagno, Moggi (2000) (2 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 258--270, St. Petersburg Beach, January 1996.
A Modal Language for Effects - Park, Harper (2004) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3), 2001.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R., and Pfenning, F. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL '96) (St. Petersburg Beach, 1996), pp. 258--270.
Combining Programming Languages and Logical Reasoning Systems.. - Sheard (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 258--270, St. Petersburg Beach, January 1996.
Evolving Domain Specific Languages - Project Summary We (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL'96), pages 258--270, St. Petersburg Beach, January 1996.
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) (Correct)
No context found.
Rowan Davies and Frank Pfenning. A modal analysis of staged computation. In 23rd Annual ACM Symposium on Principles of Programming Languages (POPL), pages 258--270, St. Petersburg Beach, 1996.
A Calculus for Probabilistic Languages - Sungwoo Park School (2003) (Correct)
No context found.
R. Davies and F. Pfenning. A modal analysis of staged computation. Journal of the ACM, 48(3), 2001.
Guarded Recursive Datatype Constructors - Xi, Chen, Chen (2003) (8 citations) (Correct)
No context found.
R. Davies and F. Pfenning. A Modal Analysis of Staged Computation. Journal of ACM, 2002.
First 50 documents Next 50
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