Obtaining coroutines with continuations
Computer Languages
Journal of Logic Programming
A syntactic theory of sequential control
Theoretical Computer Science
Rum. An intensional theory of function and control abstractions
Lecture notes in computer science on Foundations of logic 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
The definition of Standard ML
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
Program transformation in the presence of errors
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The revised report on the syntactic theories of sequential control and state
Theoretical Computer Science
A calculus of mobile processes, I
Information and Computation
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
A semantics of evidence for classical arithmetic
Journal of Symbolic Logic
Aspects of the computational content of proofs
Aspects of the computational content of proofs
A generalization of exceptions and control in ML-like languages
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Intuitionistic and classical natural deduction systems with the catch and the throw rules
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Concurrent programming in ML
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Extracting Constructive Content from Classical Logic via Control-like Reductions
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
KGC '93 Proceedings of the Third Kurt Gödel Colloquium on Computational Logic and Proof Theory
Program Extraction from Classical Proofs
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
A CPS-Translation of the Lambda-µ-Calculus
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
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
Continuation-based multiprocessing
LFP '80 Proceedings of the 1980 ACM conference on LISP and functional programming
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
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-mu Calculus
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Cut Elimination for Classical Proofs as Continuation Passing Style Computation
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
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
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
Finite Models and Full Completeness
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
On the Computational Interpretation of Negation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Disjunctive Tautologies as Synchronisation Schemes
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
A Proof Theoretical Account of Continuation Passing Style
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Duality between Call-by-Name Recursion and Call-by-Value Iteration
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Completeness of continuation models for λµ-calculus
Information and Computation - Special issue: LICS'97
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Disjunctive normal forms and local exceptions
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
A confluent λ-calculus with a catch/throw mechanism
Journal of Functional Programming
Characterizing strong normalization in a language with control operators
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Strong normalisation in the π-calculus
Information and Computation
Strong normalization of the second-order symmetric λμ-calculus
Information and Computation
Information and Computation
Strong normalization proofs by CPS-translations
Information Processing Letters
Combining algebraic effects with continuations
Theoretical Computer Science
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
An approach to call-by-name delimited continuations
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control reduction theories: The benefit of structural substitution
Journal of Functional Programming
Computation with classical sequents
Mathematical Structures in Computer Science
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
Intuitionistic Letcc via Labelled Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Intersection and Union Types in the λμμ~-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
A type-theoretic foundation of delimited continuations
Higher-Order and Symbolic Computation
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Call-by-name and call-by-value in normal modal logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Call-by-value is dual to call-by-name, extended
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Towards a canonical classical natural deduction system
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A filter model for the λµ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Program logics for sequential higher-order control
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
λµ-calculus and duality: call-by-name and call-by-value
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Call-by-value is dual to call-by-name: reloaded
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Subject reduction vs intersection / union types in λµµ
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
| Hi-index | 0.00 |