Categorial semantics and scoping
Computational Linguistics
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding ML typability is complete for deterministic exponential time
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LO and behold! Concurrent structured processes
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
The complexity of type inference for higher-order lambda calculi
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
ACM SIGPLAN Notices
A syntactic approach to fixed point computation on finite domains
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Proving memory management invariants for a language based on linear logic
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Formal parametric polymorphism
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A constructive logic of multiple subtyping
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type inference with polymorphic recursion
ACM Transactions on Programming Languages and Systems (TOPLAS)
The game of life: a CLEAN programming tutorial and case study
ACM SIGPLAN Notices
Normalizing incomplete databases
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Inductive, coinductive, and pointed types
Proceedings of the first ACM SIGPLAN international conference on Functional programming
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parallel beta reduction is not elementary recursive
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Software engineering education: Rôles of formal specification and design calculi
Annals of Software Engineering - Special issue on software engineering education
Type fixpoints: iteration vs. recursion
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Principals in programming languages: a syntactic proof technique
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
Semantics study and reality of computing
ACM Computing Surveys (CSUR)
Type-based analysis of uncaught exceptions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully reflexive intensional type analysis
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Timing Analysis of Combinational Circuits in Intuitionistic Propositional Logic
Formal Methods in System Design
A Polymorphic Environment Calculus and its Type-Inference Algorithm
Higher-Order and Symbolic Computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
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
Information and Computation - FOOL V
Objects and classes in Algol-like languages
Information and Computation - FOOL V
Parallel beta reduction is not elementary recursive
Information and Computation
Logical optimality of groundness analysis
Theoretical Computer Science
Information and Computation
Pinnacles of software engineering: 25 years of formal methods
Annals of Software Engineering
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
Journal of Automated Reasoning
Basic Simple Type Theory, J. Roger Hindley
Journal of Logic, Language and Information
A Resource Sensitive Interpretation of Lexical Functional Grammar
Journal of Logic, Language and Information
Proof Nets and the Complexity of Processing Center Embedded Constructions
Journal of Logic, Language and Information
Intersection and singleton type assignment characterizing finite Böhm-trees
Information and Computation
Equational rules for rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
Intensional analysis of quantified types
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical view of concurrent constraint programming
Nordic Journal of Computing
A Calculus for Compiling and Linking Classes
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Modular Causality in a Synchronous Stream Language
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Memoization in Type-Directed Partial Evaluation
GPCE '02 Proceedings of the 1st ACM SIGPLAN/SIGSOFT conference on Generative Programming and Component Engineering
Programs, Proofs and Parametrized Specifications
WADT '01 Selected papers from the 15th International Workshop on Recent Trends in Algebraic Development Techniques
Quantitative Semantics Revisited
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
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Proof Normalization of Structured Algebraic Specifications Is Convergent
WADT '98 Selected papers from the 13th International Workshop on Recent Trends in Algebraic Development Techniques
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
A Modal Lambda Calculus with Iteration and Case Constructs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Polymorphic Intersection Type Assignment for Rewrite Systems with Abstractions and beta-Rule
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
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
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
Equivalence in Answer Set Programming
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
A Simple Sequent System for First-Order Logic with Free Constructors
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The Calculus of algebraic Constructions
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Abstract Machines, Control, and Sequents
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Higher-Order Intuitionistic Formalization and Proofs in Hilbert's Elementary Geometry
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Monadic Presentations of Lambda Terms Using Generalized Inductive Types
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
A P-Time Completeness Proof for Light Logics
CSL '99 Proceedings of the 13th International Workshop and 8th 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
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Higher-Order Positive Set Constraints
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
The Family Intercom: Developing a Context-Aware Audio Communication System
UbiComp '01 Proceedings of the 3rd international conference on Ubiquitous Computing
The Girard-Reynolds Isomorphism
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Types, or: Where's the Difference Between CCS and pi?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
A propositional policy algebra for access control
ACM Transactions on Information and System Security (TISSEC)
Phase semantics for light linear logic
Theoretical Computer Science - Linear logic
Programming methodology
Higher-order unification and matching
Handbook of automated reasoning
Proof-assistants using dependent type systems
Handbook of automated reasoning
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
A Model for Impredicative Type Systems, Universes, Intersection Types and Subtyping
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A Static Calculus of Dependencies for the -Cube
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Decision Procedures for the Analysis of Cryptographic Protocols by Logics of Belief
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
A new framework for declarative programming
Theoretical Computer Science
Typed operational semantics for higher-order subtyping
Information and Computation
A binary modal logic for the intersection types of lambda-calculus
Information and Computation
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
Geometry of deduction via graphs of proofs
Logic for concurrency and synchronisation
Two paradigms of logical computation in affine logic?
Logic for concurrency and synchronisation
Journal of Automated Reasoning
The Girard--Reynolds isomorphism
Information and Computation - TACS 2001
Sequentiality vs. concurrency in games and logic
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Recursion over objects of functional type
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
HOL-λσ: an intentional first-order expression of higher-order logic
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
Mathematical Structures in Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Parametric polymorphism and operational equivalence
Mathematical Structures in Computer Science
Sequent combinators: a Hilbert system for the lambda calculus
Mathematical Structures in Computer Science
A general method for proving the normalization theorem for first and second order typed λ-calculi
Mathematical Structures in Computer Science
Normalization and the Yoneda embedding
Mathematical Structures in Computer Science
A computational formalization for partial evaluation
Mathematical Structures in Computer Science
A theory of classes: proofs and models
Mathematical Structures in Computer Science
Journal of Functional Programming
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Journal of Functional Programming
Computational types from a logical perspective
Journal of Functional Programming
A syntactic method for finding least fixed points of higher-order functions over finite domains
Journal of Functional Programming
Generation in the Lambek calculus framework: an approach with semantic proof nets
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
ACM SIGPLAN Notices
Poset-valued sets or how to build models for linear logics
Theoretical Computer Science - Mathematical foundations of programming semantics
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
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
ACM Transactions on Programming Languages and Systems (TOPLAS)
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
Strict bidirectional type checking
TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Permission-based ownership: encapsulating state in higher-order typed languages
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Isomorphisms of simple inductive types through extensional rewriting
Mathematical Structures in Computer Science
The logic of demand in Haskell
Journal of Functional Programming
A reflective functional language for hardware design and theorem proving
Journal of Functional Programming
Mathematical Structures in Computer Science
A structural approach to reversible computation
Theoretical Computer Science
Quantified types in an imperative language
ACM Transactions on Programming Languages and Systems (TOPLAS)
Collection analysis for Horn clause programs
Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming
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
Information and Computation
Type-theoretic design patterns
Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming
Abstract canonical presentations
Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
On the expressive power of the loop language
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Journal of Functional Programming
Investigations on the Dual Calculus
Theoretical Computer Science
Realization of natural language interfaces using lazy functional programming
ACM Computing Surveys (CSUR)
Polymorphic higher-order recursive path orderings
Journal of the ACM (JACM)
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A (restricted) quantifier elimination for security protocols
Theoretical Computer Science - Automated reasoning for security protocol analysis
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Conformal Field Theory as a Nuclear Functor
Electronic Notes in Theoretical Computer Science (ENTCS)
Syntactic Logical Relations for Polymorphic and Recursive Types
Electronic Notes in Theoretical Computer Science (ENTCS)
The Girard—Reynolds isomorphism (second edition)
Theoretical Computer Science
Tool Support for Proof Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
Electronic Notes in Theoretical Computer Science (ENTCS)
Light Dialectica Program Extraction from a Classical Fibonacci Proof
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternative Logics: a book review: SIGACT news logic column 18
ACM SIGACT News
Termination of abstract reduction systems
CATS '07 Proceedings of the thirteenth Australasian symposium on Theory of computing - Volume 65
An abstraction-based genetic programming system
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
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
Full abstraction for polymorphic π-calculus
Theoretical Computer Science
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Electronic Notes in Theoretical Computer Science (ENTCS)
Minimality in a Linear Calculus with Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
The heart of intersection type assignment: Normalisation proofs revisited
Theoretical Computer Science
A typed lambda calculus with intersection types
Theoretical Computer Science
Various Constructions of Continuous Information Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Genetic programming with polymorphic types and higher-order functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Semantically linear programming languages
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
An insertion operator preserving infinite reduction sequences
Mathematical Structures in Computer Science
Uniformity and the Taylor expansion of ordinary lambda-terms
Theoretical Computer Science
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
The Intensional Lambda Calculus
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Proof Identity for Classical Logic: Generalizing to Normality
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Bidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Syntactic Metatheory of Higher-Order Subtyping
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The visitor pattern as a reusable, generic, type-safe component
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Electronic Notes in Theoretical Computer Science (ENTCS)
An Algorithmic Interpretation of a Deep Inference System
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Weak βη -Normalization and Normalization by Evaluation for System F
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Operational semantics for multi-language programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Hoare type theory, polymorphism and separation1
Journal of Functional Programming
Mathematical Structures in Computer Science
Information and Computation
Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
Sanskrit Computational Linguistics
Extending the loop language with higher-order procedural variables
ACM Transactions on Computational Logic (TOCL)
Journal of Functional Programming
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Relating Classical Realizability and Negative Translation for Existential Witness Extraction
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
On the Values of Reducibility Candidates
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Automated deduction for verification
ACM Computing Surveys (CSUR)
Logical Semantics for Stability
Electronic Notes in Theoretical Computer Science (ENTCS)
Pedagogical second-order λ-calculus
Theoretical Computer Science
ACM Transactions on Computational Logic (TOCL)
Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Social processes, program verification and all that
Mathematical Structures in Computer Science
Annals of Mathematics and Artificial Intelligence
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Type-theoretic Reconstruction of the Visitor Pattern
Electronic Notes in Theoretical Computer Science (ENTCS)
Lightweight linear types in system f°
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
Information and Computation
Directly reflective meta-programming
Higher-Order and Symbolic Computation
Interactive verification of concurrent systems using symbolic execution
AI Communications - Practical Aspects of Automated Reasoning
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
Journal of Logic, Language and Information
On the Membership Problem for Non-Linear Abstract Categorial Grammars
Journal of Logic, Language and Information
Towards a Type-Theoretical Account of Lexical Semantics
Journal of Logic, Language and Information
Theoretical Computer Science
Formal system of interactions on biomedical ontology
Proceedings of the 2010 conference on Information Modelling and Knowledge Bases XXI
Induction is not derivable in second order dependent type theory
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
Distinguishing data structures and functions: the constructor calculus and functorial types
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
A game semantics for generic polymorphism
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Confluence as a cut elimination property
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Rewriting modulo in deduction modulo
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Axiomatic criteria for quotients and subobjects for higher-order data types
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the stability by union of reducibility candidates
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Inductive types in the calculus of algebraic constructions
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
On strong normalization in the intersection type discipline
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Abstraction barrier-observing relational parametricity
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
A finite first-order presentation of set theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A new model construction for the polymorphic lambda calculus
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
A formal calculus for informal equality with binding
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Extensional rewriting with sums
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Higher-order logic programming languages with constraints: a semantics
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Polymorphic delimited continuations
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Incremental biomedical ontology change management through learning agents
KES-AMSTA'08 Proceedings of the 2nd KES International conference on Agent and multi-agent systems: technologies and applications
Theorem proving modulo based on Boolean equational procedures
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
HOL2P - a system of classical higher order logic with second order polymorphism
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Typed applicative structures and normalization by evaluation for system Fω
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Automating theories in intuitionistic logic
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Rewriting systems for the surface classification theorem
Mathematical Structures in Computer Science
Understanding Game Semantics Through Coherence Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
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
Harnessing MLFwith the power of system F
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Termination in impure concurrent languages
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Information and Computation
Functions as processes: termination and the λµµ-calculus
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Assumption-based reasoning in dynamic normative agent systems
Web Intelligence and Agent Systems
HyperGraphDB: a generalized graph database
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
A simple class of Kripke-style models in which logic and computation have equal standing
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Realizability models and implicit complexity
Theoretical Computer Science
Theoretical Computer Science
Normative conflicts in electronic contracts
Electronic Commerce Research and Applications
Ontologies and coherence spaces
Ludics, dialogue and interaction
A modified GoI interpretation for a linear functional programming language and its adequacy
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Linearity and recursion in a typed Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Linear lambda calculus and deep inference
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
Typed self-interpretation by pattern matching
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Linearity and PCF: a semantic insight!
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Static livelock analysis in CSP
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
On type coercion in compositional and lexical semantics
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Intuitionistic hybrid logic: Introduction and survey
Information and Computation
Classical Logic with Partial Functions
Journal of Automated Reasoning
Shared-variable concurrency: a proposal
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Polarized subtyping for sized types
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
A simple semantics for polymorphic recursion
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Termination analysis of higher-order functional programs
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
The marriage of bisimulations and Kripke logical relations
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
A dolev-yao model for zero knowledge
ASIAN'09 Proceedings of the 13th Asian conference on Advances in Computer Science: information Security and Privacy
Nominal techniques in Isabelle/HOL
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Full abstraction for polymorphic pi-calculus
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Galois embedding from polymorphic types into existential types
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
Reducibility and ⊤⊤-lifting for computation types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Higher-Order rewriting: framework, confluence and termination
Processes, Terms and Cycles
Parameterised multiparty session types
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
MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming
Strongly Typed Term Representations in Coq
Journal of Automated Reasoning
Stratification in logics of definitions
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Combining Deduction Modulo and Logics of Fixed-Point Definitions
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Extensibility for the masses: practical extensibility with object algebras
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Strong Normalisation of Cut-Elimination in Classical Logic
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
A Simple Adequate Categorical Model for PCF, II
Fundamenta Informaticae
An Axiomatic System of Parametricity
Fundamenta Informaticae
Mechanization Of Real-Time Linear Csp With Higher Order Logic
Fundamenta Informaticae
On Definitional Transformations To Normal Form For Intuitionistic Logic
Fundamenta Informaticae
Formal foundations for situation awareness based on dependent type theory
Information Fusion
Parametric And Type-Dependent Polymorphism
Fundamenta Informaticae
Computability closure: ten years later
Rewriting Computation and Proof
Rewriting Computation and Proof
Fair cooperative multithreading: typing termination in a higher-order concurrent imperative language
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Syllogisms in Rudimentary Linear Logic, Diagrammatically
Journal of Logic, Language and Information
Behavioral polymorphism and parametricity in session-based communication
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Wellfounded recursion with copatterns: a unified approach to termination and productivity
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Multi-polymorphic programming in bondi
Proceedings of the 9th ACM SIGPLAN workshop on Generic programming
A decidable theory of type assignment
Archive for Mathematical Logic
Automatically generated infrastructure for de bruijn syntaxes
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Logical relations for a logical framework
ACM Transactions on Computational Logic (TOCL)
J-Calc: A Typed Lambda Calculus for Intuitionistic Justification Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
The Cost of Usage in the ?-Calculus
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
Intersection Types from a Proof-theoretic Perspective
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.01 |