Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Logic programming in the LF logical framework
Logical frameworks
Two-level functional languages
Two-level functional languages
Partial evaluation and automatic program generation
Partial evaluation and automatic program generation
Optimizing ML with run-time code generation
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
C: a language for high-level, efficient, and machine-independent dynamic code generation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A general approach for run-time specialization and its application to C
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modal analysis of staged computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Multi-stage programming with explicit annotations
PEPM '97 Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Information and Computation
Run-time code generation and modal-ML
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Modal types as staging specifications for run-time code generation
ACM Computing Surveys (CSUR) - Special issue: electronic supplement to the September 1998 issue
A simple applicative language: mini-ML
LFP '86 Proceedings of the 1986 ACM conference on LISP and functional programming
Programming languages capturing complexity classes
ACM SIGACT News
Compilers and staging transformations
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Primitive Recursion for Higher-Order Abstract Syntax
TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Efficient Algebraic Operations on Programs
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Multi-Stage Programming: Axiomatization and Type Safety
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Efficient Multi-level Generating Extensions for Program Specialization
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Mechanically Verifying the Correctness of an Offline Partial Evaluator
PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
A temporal-logic approach to binding-time analysis
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Reflection and semantics in LISP
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
Computational types from a logical perspective
Journal of Functional Programming
A lightweight implementation of generics and dynamics
Proceedings of the 2002 ACM SIGPLAN workshop on Haskell
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Guarded recursive datatype constructors
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus for probabilistic languages
Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation
From dynamic binding to state via modal possibility
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Meta-programming through typeful code representation
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
A judgmental reconstruction of modal logic
Mathematical Structures in Computer Science
Neural-symbolic intuitionistic reasoning
Design and application of hybrid intelligent systems
Safe query objects: statically typed objects as remotely executable queries
Proceedings of the 27th international conference on Software engineering
Meta-programming through typeful code representation
Journal of Functional Programming
Staged computation with names and necessity
Journal of Functional Programming
A polymorphic modal type system for lisp-like multi-staged languages
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A modal type system for multi-level generating extensions with persistent code
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
MetaOCaml server pages: web publishing as staged computation
Science of Computer Programming - Special issue on the first MetaOCaml workshop 2004
Connectionist computations of intuitionistic reasoning
Theoretical Computer Science
Closing the stage: from staged code to typed closures
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism*
Journal of Functional Programming
ACM Transactions on Computational Logic (TOCL)
The Intensional Lambda Calculus
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The Logic of Proofs as a Foundation for Certifying Mobile Computation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
A Logical Foundation for Environment Classifiers
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Type-specialized staged programming with process separation
Proceedings of the 2009 ACM SIGPLAN workshop on Generic programming
Abstract parsing for two-staged languages with concatenation
GPCE '09 Proceedings of the eighth international conference on Generative programming and component engineering
Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages
Journal of Functional Programming
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Deriving compilers and virtual machines for a multi-level language
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Finally tagless, partially evaluated: tagless staged interpreters for simpler typed languages
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Call-by-name and call-by-value in normal modal logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Embedding Constructive K into Intuitionistic K
Electronic Notes in Theoretical Computer Science (ENTCS)
Justification logic and history based computation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Static analysis of multi-staged programs via unstaging translation
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program logics for homogeneous meta-programming
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Label-free proof systems for intuitionistic modal logic IS5
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Sequent calculi and decidability for intuitionistic hybrid logic
Information and Computation
Constructive linear-time temporal logic: Proof systems and Kripke semantics
Information and Computation
The essence of dataflow programming
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Program generation and components
FMCO'04 Proceedings of the Third international conference on Formal Methods for Components and Objects
Shifting the stage: Staging with delimited control
Journal of Functional Programming
Type and effect system for multi-staged exceptions
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
Polymorphic multi-stage language with control effects
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Staged computation with staged lexical scope
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Explicitly heterogeneous metaprogramming with MetaHaskell
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Type-specialized staged programming with process separation
Higher-Order and Symbolic Computation
A practical theory of language-integrated query
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
An operational foundation for the tactic language of Coq
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Specification patterns for reasoning about recursion through the store
Information and Computation
Intuitionistic Hypothetical Logic of Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |
We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of typed &lgr;-calculi and functional languages. We directly demonstrate the sense in which our l→□e -calculus captures staging, and also give a conservative embeddng of Nielson and Nielson's two-level functional language in our functional language Mini-ML □ , thus proving that binding-time correctness is equivalent to modal correctness on this fragment. In addition, Mini-ML□ can also express immediate evaluation and sharing of code across multiple stages, thus supporting run-time code generation as well as partial evaluation.