The system F of variable types, fifteen years later
Theoretical Computer Science
Theoretical Computer Science
Information and Computation - Semantics of Data Types
Proofs and types
Theoretical Computer Science - Special issue: Fourth workshop on mathematical foundations of programming semantics, Boulder, CO, May 1988
Theoretical Computer Science
Tutorial notes on partial evaluation
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lambda-calculus, types and models
Lambda-calculus, types and models
Journal of Computer and System Sciences
A generic account of continuation-passing styles
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fully abstract semantics for observably sequential languages
Information and Computation
Games and full completeness for multiplicative linear logic
Journal of Symbolic Logic
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
Hypercoherences: a strongly stable model of linear logic
Proceedings of the workshop on Advances in linear logic
Geometry of interaction III: accommodating the additives
Proceedings of the workshop on Advances in linear logic
Forum: a multiple-conclusion specification logic
ALP Proceedings of the fourth international conference on Algebraic and logic programming
Domains and lambda-calculi
A relative PCF-definability result for strongly stable functions and some corollaries
Information and Computation
Theoretical Computer Science - Special issue on linear logic, 1
On full abstraction for PCF: I, II, and III
Information and Computation
Information and Computation
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Theory of Objects
Definitional Interpreters for Higher-Order Programming Languages
Higher-Order and Symbolic Computation
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
Hereditarily Sequential Functionals
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Proceedings of the 5th International Conference on Mathematical Foundations of Programming Semantics
On the Symmetry of Sequentiality
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Game semantics and abstract machines
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Correctness of Multiplicative Proof Nets is Linear
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Pontrjagin duality and full completeness for multiplicative linear logic (without Mix)
Mathematical Structures in Computer Science
On the Proofs of Some Formally Unprovable Propositions and Prototype Proofs in Type Theory
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
A Formalised First-Order Confluence Proof for the lambda-Calculus Using One-Sorted Variable Names
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
Non-commutative logic III: focusing proofs
Information and Computation
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
Mathematical Structures in Computer Science
Collection analysis for Horn clause programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
Interactive observability in Ludics: the geometry of tests
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Syntax vs. semantics: a polarized approach
Theoretical Computer Science - Game theory meets theoretical computer science
Structure of proofs and the complexity of cut elimination
Theoretical Computer Science
Theoretical Computer Science - Logic, language, information and computation
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Observational Equivalence for the Interaction Combinators and Internal Separation
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternative Logics: a book review: SIGACT news logic column 18
ACM SIGACT News
A Graph Abstract Machine Describing Event Structure Composition
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 Logical Characterization of Forward and Backward Chaining in the Inverse Method
Journal of Automated Reasoning
Theoretical Computer Science
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
A System F with Call-by-Name Exceptions
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An Indexed System for Multiplicative Additive Polarized Linear Logic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 3rd workshop on Programming languages meets program verification
Refinement types and computational duality
Proceedings of the 3rd workshop on Programming languages meets program verification
Focusing Strategies in the Sequent Calculus of Synthetic Connectives
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Towards Ludics Programming: Interactive Proof Search
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
From Hilbert's program to a logic tool box
Annals of Mathematics and Artificial Intelligence
Ludics and Its Applications to Natural Language Semantics
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
On the Meaning of Logical Completeness
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Partial Orders, Event Structures and Linear Strategies
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
A Polymorphic Type System for the Lambda-Calculus with Constructors
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
DSL '09 Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages
Contraction-free Proofs and Finitary Games for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
The λ-calculus with constructors: Syntax, confluence and separation
Journal of Functional Programming
A Concurrent Model for Linear Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
A Game Semantics for Proof Search: Preliminary Results
Electronic Notes in Theoretical Computer Science (ENTCS)
A logical framework with dependently typed records
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Nondeterministic light logics and NP-time
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Strong normalization and equi-(co)inductive types
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Ludics is a model for the finitary linear pi-calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
A logical calculus for modelling interferences
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Least and greatest fixed points in linear logic
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
The separation theorem for differential interaction nets
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Finding unity in computational logic
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
From Focalization of Logic to the Logic of Focalization
Electronic Notes in Theoretical Computer Science (ENTCS)
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Constructive semantics for instantaneous reactions
Theoretical Computer Science
Theoretical Computer Science
Geometry of Interaction V: Logic in the hyperfinite factor
Theoretical Computer Science
Theoretical Computer Science
Non-uniform (hyper/multi)coherence spaces
Mathematical Structures in Computer Science
Ludics, dialogue and interaction
Ludics, dialogue and interaction
Ludics and web: another reading of standard operations
Ludics, dialogue and interaction
On the meaning of focalization
Ludics, dialogue and interaction
On some logic games in their philosophical context
Ludics, dialogue and interaction
Ontologies and coherence spaces
Ludics, dialogue and interaction
Logic and grammar
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
Commutative locative quantifiers for multiplicative linear logic
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Jump from parallel to sequential proofs: multiplicatives
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A logical characterization of forward and backward chaining in the inverse method
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
L-Nets, strategies and proof-nets
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Focusing the inverse method for linear logic
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
A lambda-calculus with constructors
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
An approach to innocent strategies as graphs
Information and Computation
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
Ludics and natural language: first approaches
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
From proofs to focused proofs: a modular proof of focalization in linear logic
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Strong Normalization in the π-calculus with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.01 |
Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) The headquarters of the People Programmer was at An-Fang, and there the mistake happened: A ruby trembled. Two tourmaline nets failed to rectify the laser beam. A diamond noted the error. Both the error and the correction went into the general computer. Cordwainer Smith The Dead Lady of Clown Town, 1964.