Davies, R. 1996. A temporal logic approach to binding-time analysis. In Symposium on Logic in Computer Science, LICS'96, E. Clarke, Ed. IEEE Computer Society Press, New Brunswick, New Jersey, 184--195. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Accomplishments and Research Challenges in Meta-Programming - Sheard (2000) (16 citations) (Correct)
....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 utility of program ....
....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. A temporal-logic approach to binding-time analysis. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 184-195, New Brunswick, July 1996. IEEE Computer Society Press.
MetaKlaim: A Type Safe Multi-stage Language for Global Computing - Ferrari, Moggi (2 citations) (Correct)
....v safely. 4 Type System The type system derives judgments of the following forms . i.e. # is a well formed context . n t, i.e. t is a well formed type at level n . n e: t, i.e. e is a well formed term of type t at level n Levels are typical of multi level languages (like # # of [Dav96] In a dynamically typed multistage language, like MetaKlaim (see also [SSP98] type variables get bound at di#erent stages of a computation, and thus well formedness is level dependent not only for terms, but also for types. The declarations in a context # have the following meaning: X ....
R. Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184--195, New Brunswick, 1996. IEEE Computer Society Press.
A Modal Analysis of Staged Computation - Rowan Davies And (1996) (124 citations) Self-citation (Davies) (Correct)
No context found.
Davies, R. 1996. A temporal-logic approach to binding-time analysis. In E. Clarke Ed., Proceedings of the Eleventh Annual Symposium on Logic in Computer Science (LICS'96) (July 1996), pp. 184--195.
A Modal Analysis of Staged Computation - Rowan Davies And (1999) (124 citations) Self-citation (Davies) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 184--195, July 1996.
Contextual Model Type Theory - Nanevski, Pfenning, Pientka (2005) (Correct)
No context found.
Davies, R. 1996. A temporal logic approach to binding-time analysis. In Symposium on Logic in Computer Science, LICS'96, E. Clarke, Ed. IEEE Computer Society Press, New Brunswick, New Jersey, 184--195.
Staged Computation with Names and Necessity - Nanevski, Pfenning (2005) (Correct)
No context found.
Davies, Rowan. (1996). A temporal logic approach to binding-time analysis. Pages 184-- 195 of: Symposium on Logic in Computer Science, LICS'96.
Staged Notational Definitions - Walid Taha And (Correct)
No context found.
Davies, R. A temporal-logic approach to binding-time analysis. In Symposium on Logic in Computer Science (1996), IEEE Computer Society Press, pp. 184--195.
An Idealized MetaML: Simpler, and More Expressive - Moggi, Taha, Benaissa, Sheard (1999) (2 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 184--195, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184-195, New Brunswick, 1996. IEEE Computer Society Press.
Staging Dynamic Programming Algorithms - Kedar Swadi Kswadi (2005) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184--195, New Brunswick, 1996. IEEE Computer Society Press.
Closed Types as a Simple Approach to Safe Imperative.. - Calcagno, Moggi, Taha (2000) (4 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 184--195, New Brunswick, July 1996. IEEE Computer Society Press.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96) (New Brunswick, 1996), IEEE Computer Society Press, pp. 184--195.
Meta-Programming through Typeful Code Representation - Chen, Xi (2003) (4 citations) (Correct)
No context found.
R. Davies. A temporal logic approach to binding-time analysis. In Symposium on Logic in Computer Science (LICS '96), pages 184--195, 1996.
Type Refinements - Harper, Pfenning (2001) (Correct)
No context found.
Rowan Davies. A temporal logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual Symposium on Logic in Computer Science, pages 184--195, New Brunswick, New Jersey, July 1996. IEEE Computer Society Press.
A Fresh Calculus for Name Management - Ancona, Moggi (Correct)
No context found.
R. Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184--195, New Brunswick, 1996. IEEE Computer Society Press.
ML-like Inference for Classifiers - Calcagno, Moggi, Taha (2004) (5 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184--195, New Brunswick, 1996. IEEE Computer Society Press.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96) (New Brunswick, 1996), IEEE Computer Society Press, pp. 184--195.
A Calculus for Symbolic Names Management - Ancona, Moggi (2003) (Correct)
No context found.
R. Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96), pages 184--195, New Brunswick, 1996. IEEE Computer Society Press.
Binding-Time Analysis for MetaML via Type Inference and.. - Linger, Sheard (2004) (1 citation) (Correct)
No context found.
Davies, R.: A temporal-logic approach to binding-time analysis. In: Logic in Computer Science. (1996) 184-195
Multi-Stage Imperative Languages: A Conservative Extension.. - Calcagno, Moggi (2000) (2 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In Proceedings, 11 th Annual IEEE Symposium on Logic in Computer Science, pages 184--195, New Brunswick, July 1996. IEEE Computer Society Press.
Staged Notational Definitions - Walid Taha And (Correct)
No context found.
Davies, R. A temporal-logic approach to binding-time analysis. In Symposium on Logic in Computer Science (1996), IEEE Computer Society Press, pp. 184--195.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. (Correct)
No context found.
Davies, R. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS '96) (New Brunswick, 1996), IEEE Computer Society Press, pp. 184--195.
Combining Programming Languages and Logical Reasoning Systems.. - Sheard (Correct)
No context found.
Rowan Davies. A temporal logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, pages 184--195. IEEE Computer Society Press, July 1996.
Evolving Domain Specific Languages - Project Summary We (Correct)
No context found.
Rowan Davies. A temporal logic approach to binding-time analysis. In E. Clarke, editor, Proceedings of the Eleventh Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, pages 184--195. IEEE Computer Society Press, July 1996.
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) (Correct)
No context found.
Rowan Davies. A temporal-logic approach to binding-time analysis. In 11 th Annual IEEE Symposium on Logic in Computer Science (LICS), pages 184-- 195, New Brunswick, 1996. IEEE Computer Society Press.
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