Continuations may be unreasonable
LFP '88 Proceedings of the 1988 ACM conference on LISP and functional programming
The theory and practice of first-class prompts
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning with continuations II: full abstraction for models of control
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Typing first-class continuations in ML
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Models of continuations without continuations
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about programs in continuation-passing style.
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Back to direct style II: first-class continuations
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Observable sequentiality and full abstraction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sound rules for parallel evaluation of a functional language callcc
FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Total correctness by local improvement in program transformation
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order expression procedures
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A polymorphic record calculus and its compilation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Total correctness by local improvement in the transformation of functional programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verification of Erlang programs using abstract interpretation and model checking
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A Polymorphic Environment Calculus and its Type-Inference Algorithm
Higher-Order and Symbolic Computation
Revised report on the algorithmic language scheme
ACM SIGPLAN Lisp Pointers
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A Syntactic Theory of Dynamic Binding
Higher-Order and Symbolic Computation
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
Portable implementation of continuation operators in imperative languages by exception handling
Advances in exception handling techniques
Exceptions, Continuations and Macro-expressiveness
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
Strong Normalization of Second Order Symmetric lambda-Calculus
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Concurrent Execution Semantics of DAML-S with Subtypes
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Concurrent Semantics for the Web Services Specification Language DAML-S
COORDINATION '02 Proceedings of the 5th International Conference on Coordination Models and Languages
Portable Implementation of Continuation Operators in Imperative Languages by Exception Handling
Advances in Exception Handling Techniques (the book grow out of a ECOOP 2000 workshop)
A Type-Theoretic Study on Partial Continuations
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
On the Computational Interpretation of Negation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Completeness of continuation models for λµ-calculus
Information and Computation - Special issue: LICS'97
A semantic view of classical proofs: type-theoretic, categorical, and denotational characterizations
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
CPS in little pieces: composing partial continuations
Journal of Functional Programming
A confluent λ-calculus with a catch/throw mechanism
Journal of Functional Programming
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
Classical linear logic of implications
Mathematical Structures in Computer Science
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
Proceedings of the 6th international conference on Aspect-oriented software development
Selective strictness and parametricity in structural operational semantics, inequationally
Theoretical Computer Science
ACM SIGPLAN Lisp Pointers
An operational semantics for scheme1
Journal of Functional Programming
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Universe Types for Topology and Encapsulation
Formal Methods for Components and Objects
Operational semantics for multi-language programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transactions on Aspect-Oriented Software Development V
A Context-based Approach to Proving Termination of Evaluation
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical Program Extraction from Classical Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Strong normalization of classical natural deduction with disjunction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
Musings around the geometry of interaction, and coherence
Theoretical Computer Science
Classical call-by-need and duality
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Hobbits for Haskell: a library for higher-order encodings in functional programming languages
Proceedings of the 4th ACM symposium on Haskell
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
Subject reduction vs intersection / union types in λµµ
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A systematic approach to delimited control with multiple prompts
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
On the Expressiveness of Affine Programs with Non-local Control: The Elimination of Nesting in SPCF
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
An operational and axiomatic semantics for non-determinism and sequence points in C
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Unifying Classical and Intuitionistic Logics for Computational Control
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 5.23 |