Functional back-ends within the lambda-sigma calculus
Proceedings of the first ACM SIGPLAN international conference on Functional programming
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Theoretical Computer Science
An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
A Curry-Howard Isomorphism for Compilation and Program Execution
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Strong Normalisation of Cut-Elimination in Classical Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Fully Automatic Adaptation of Software Components Based on Semantic Specifications
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
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
A CPS-Transform of Constructive Classical Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
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
Call-by-value is dual to call-by-name
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Mathematical Structures in Computer Science
Cut rules and explicit substitutions
Mathematical Structures in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Functional runtime systems within the lambda-sigma calculus
Journal of Functional Programming
Pattern matching as cut elimination
Theoretical Computer Science
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Resource operators for λ-calculus
Information and Computation
On the Computational Representation of Classical Logical Connectives
Electronic Notes in Theoretical Computer Science (ENTCS)
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Refocusing Generalised Normalisation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
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
Sequent calculi and abstract machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Strong normalisation for a gentzen-like cut-elimination procedure
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Safe compositional network sketches: formal framework
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Minimal classical logic and control operators
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Permutative conversions in intuitionistic multiary sequent calculi with cuts
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
On a logical foundation for explicit substitutions
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Completing Herbelin's programme
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An isomorphism between cut-elimination procedure and proof reduction
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
On a logical foundation for explicit substitutions
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Simple proofs of characterizing strong normalization for explicit substitution calculi
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Characterising strongly normalising intuitionistic sequent terms
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Strong normalisation of cut-elimination that simulates β-reduction
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
A calculus of multiary sequent terms
ACM Transactions on Computational Logic (TOCL)
Nested proof search as reduction in the Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Intuitionistic sequent-style calculus with explicit structural rules
TbiLLC'09 Proceedings of the 8th international tbilisi conference on Logic, language, and computation
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On a local-step cut-elimination procedure for the intuitionistic sequent calculus
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LJQ: a strongly focused calculus for intuitionistic logic
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
A sequent calculus for type theory
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Graph-based proof counting and enumeration with applications for program fragment synthesis
LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Extending the explicit substitution paradigm
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Structural proof theory as rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Universal properties of impure programming languages
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.00 |