A Curry-Howard foundation for functional computation with control
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A term calculus for unitary approach to normalization
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on 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
Towards the animation of proofs---testing proofs by examples
Theoretical Computer Science - Special issue on theories of types and proofs
Strong normalizability of the non-deterministic catch/throw calculi
Theoretical Computer Science - Special issue on theories of types and proofs
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Journal of Logic, Language and Information
An interpretation of λµ-calculus in λ-calculus
Information Processing Letters
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
Polarized proof-nets and λµ-calculus
Theoretical Computer Science
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
Sharing Continuations: Proofnets for Languages with Explicit Control
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
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
Strong Normalisation of Cut-Elimination in Classical Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
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
Revisiting the Correspondence between Cut Elimination and Normalisation
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Axioms for Recursion in Call-by-Value
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
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
Partially Typed Terms between Church-Style and Curry-Style
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
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
Abstract Machines, Control, and Sequents
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
On the Computational Interpretation of Negation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical Logic
CSL '01 Proceedings of the 15th International Workshop 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
Classical Linear Logic of Implications
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
Computational isomorphisms in classical logic
Theoretical Computer Science - Linear 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
The Curry-Howard Correspondence in Set Theory
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Dependent choice, 'quote' and the clock
Theoretical Computer Science
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
An environment machine for the λμ-calculus
Mathematical Structures in Computer Science
A confluent λ-calculus with a catch/throw mechanism
Journal of Functional Programming
Classical logic, continuation semantics and abstract machines
Journal of Functional Programming
Journal of Functional Programming
Limiting partial combinatory algebras
Theoretical Computer Science
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
A type-theoretic foundation of continuations and prompts
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Strong normalisation in the π-calculus
Information and Computation
Strong normalization of the second-order symmetric λμ-calculus
Information and Computation
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
Getting results from programs extracted from classical proofs
Theoretical Computer Science
Classical linear logic of implications
Mathematical Structures in Computer Science
Strong normalization proofs by CPS-translations
Information Processing Letters
Investigations on the Dual Calculus
Theoretical Computer Science
A complete, co-inductive syntactic theory of sequential control and state
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Categorical proof theory of classical propositional calculus
Theoretical Computer Science - Logic, language, information and computation
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Resource operators for λ-calculus
Information and Computation
A syntactic correspondence between context-sensitive calculi and abstract machines
Theoretical Computer Science
Combining algebraic effects with continuations
Theoretical Computer Science
Theoretical Computer Science
On the Computational Representation of Classical Logical Connectives
Electronic Notes in Theoretical Computer Science (ENTCS)
A proof theory for machine code
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relating complexity and precision in control flow analysis
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
A rewriting calculus for cyclic higher-order term graphs
Mathematical Structures in Computer Science
Higher-Order and Symbolic Computation
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
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Computation with classical sequents
Mathematical Structures in Computer Science
CERES: An analysis of Fürstenberg's proof of the infinity of primes
Theoretical Computer Science
On the Relations between the Syntactic Theories of λμ-Calculi
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Proofs, tests and continuation passing style
ACM Transactions on Computational Logic (TOCL)
Shifting the stage: staging with delimited control
Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation
An Algorithmic Interpretation of a Deep Inference System
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Denotational Semantics of Call-by-name Normalization in Lambda-mu Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards Ludics Programming: Interactive Proof Search
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Intuitionistic Letcc via Labelled Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Logic, Language, and Computation
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Game Semantics for Access Control
Electronic Notes in Theoretical Computer Science (ENTCS)
Pedagogical second-order λ-calculus
Theoretical Computer Science
A Logical Interpretation of the λ-Calculus into the η-Calculus, Preserving Spine Reduction and Types
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Social processes, program verification and all that
Mathematical Structures in Computer Science
Theoretical Computer Science
Weyl's predicative classical mathematics as a logic-enriched type theory
ACM Transactions on Computational Logic (TOCL)
Classical Natural Deduction for S4 Modal Logic
APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
A Semantics of Realisability for the Classical Propositional Natural Deduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Why the Usual Candidates of Reducibility Do Not Work for the Symmetric λμ-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Calculus for Cyclic Higher-order Term Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection and Union Types in the λμμ~-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
A Concurrent Model for Linear Logic
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
Categorical semantics of control
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Strong normalization of classical natural deduction with disjunction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
A deconstruction of non-deterministic classical cut elimination
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Parigot's second order λµ-calculus and inductive types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A sound and complete CPS-translation for λµ-calculus
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Parameterizations and fixed-point operators on control categories
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Polarized proof nets with cycles and fixpoints semantics
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Monad translating inductive and coinductive types
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Completing Herbelin's programme
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
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
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
A complete, co-inductive syntactic theory of sequential control and state
Semantics and algebraic specification
Equational axiomatization of call-by-name delimited control
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
What is the problem with proof nets for classical logic?
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
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 sequent calculus with implicit term representation
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Theoretical Computer Science
The calculus of responsibility and commitment
Ludics, dialogue and interaction
Negative translations and duality: toward a unified approach
Ludics, dialogue and interaction
Covert movement in logical grammar
Logic and grammar
Classical call-by-need and duality
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
A filter model for the λµ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Approximation semantics and expressive predicate assignment for object-oriented programming
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Type checking and typability in domain-free lambda calculi
Theoretical Computer Science
The language X: circuits, computations and classical logic
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Strong normalization of the dual classical sequent calculus
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Explanation in natural language of λμμ-Terms
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Program logics for sequential higher-order control
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Shifting the stage: Staging with delimited control
Journal of Functional Programming
Arithmetical proofs of strong normalization results for the symmetric λµ-calculus
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Galois embedding from polymorphic types into existential types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
On the degeneracy of Σ-types in presence of computational classical logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Naming proofs in classical propositional logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi 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
λµ-calculus and duality: call-by-name and call-by-value
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Extending the explicit substitution paradigm
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
Distributed control flow with classical modal logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Light functional interpretation
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Type checking and inference are equivalent in lambda calculi with existential types
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Linearly-Used continuations in the enriched effect calculus
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
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
Approaches to polymorphism in classical sequent calculus
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
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
Applicative bisimulations for delimited-control operators
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Classical call-by-need sequent calculi: the unity of semantic artifacts
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
Importing montagovian dynamics into minimalism
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
A Constructive Proof of Dependent Choice, Compatible with Classical Logic
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Arithmetical Proofs of Strong Normalization Results for Symmetric λ-calculi
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
An output-based semantics of Λμ with explicit substitution in the π-calculus: extended abstract
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The recursive polarized dual calculus
Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Semantic Types and Approximation for Featherweight Java
Theoretical Computer Science
Unifying Classical and Intuitionistic Logics for Computational Control
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.02 |