POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Implicative formulae in the proofs of computations' analogy
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transformations on higher-order functions
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
The semantic foundations of concurrent constraint programming
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The essence of functional programming
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PER models of subtyping, recursive types and higher-order polymorphism
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Institutions: abstract model theory for specification and programming
Journal of the ACM (JACM)
Parametricity and local variables
Journal of the ACM (JACM)
Pi-calculus, dialogue games and full abstraction PCF
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Confluence properties of weak and strong calculi of explicit substitutions
Journal of the ACM (JACM)
Inductive, coinductive, and pointed types
Proceedings of the first ACM SIGPLAN international conference on Functional programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Two applications of analytic functors
Theoretical Computer Science - Special issue on theories of types and proofs
Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Basic Simple Type Theory, J. Roger Hindley
Journal of Logic, Language and Information
Axioms for Recursion in Call-by-Value
Higher-Order and Symbolic Computation
A logical view of concurrent constraint programming
Nordic Journal of Computing
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Linear Logic Treatment of Phrase Structure Grammars for Unbounded Dependencies
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
A Framework for the Hyperintensional Semantics of Natural Language with Two Implementations
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters
Lambda Definability with Sums via Grothendieck Logical Relations
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Universal Arrow Foundations for Visual Modeling
Diagrams '00 Proceedings of the First International Conference on Theory and Application of Diagrams
HASCASL: Towards Integrated Specification and Development of Functional Programs
AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Logical Relations in Circuit Verification
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Invited Talk: Pointwise Relational Programming
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
A Modal Formulation of McCain and Turner's Theory of Causal Reasoning
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
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
Coherent Bicartesian and Sesquicartesian Categories
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Towards a Topos Theoretic Foundation for the Irish School of Constructive Mathematics
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Data-Refinement for Call-By-Value Programming Languages
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Logical Relations and Data Abstraction
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Life without the Terminal Type
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Categorical and Kripke Semantics for Constructive S4 Modal Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Chu spaces as a semantic bridge between linear logic and mathematics
Theoretical Computer Science - Linear logic
A fully abstract model for the π-calculus
Information and Computation
Ideal models for pointwise relational and state-free imperative programming
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Handbook of automated reasoning
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
A General Notion of Realizability
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Term rewriting for normalization by evaluation
Information and Computation - Special issue: ICC '99
A new framework for declarative programming
Theoretical Computer Science
The constructed objectivity of mathematics and the cognitive subject
Quantum mechanics, mathematics, cognition and action
Proof theory of higher-order equations: conservativity, normal forms and term rewriting
Journal of Computer and System Sciences
Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Adapting innocent game models for the Böhm tree λ-theory
Theoretical Computer Science
Paracategories I: internal paracategories and saturated partial algebras
Theoretical Computer Science
Double categories: a modular model of multiplicative linear logic
Mathematical Structures in Computer Science
Realizability: a historical essay
Mathematical Structures in Computer Science
Control categories and duality: on the categorical semantics of the lambda-mu calculus
Mathematical Structures in Computer Science
Elementary structures in process theory (1): Sets with renaming
Mathematical Structures in Computer Science
Introduction to linear bicategories
Mathematical Structures in Computer Science
Topological representation of the λ-calculus
Mathematical Structures in Computer Science
Normalization and the Yoneda embedding
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
Isomorphic objects in symmetric monoidal closed categories
Mathematical Structures in Computer Science
Categorical logic of names and abstraction in action calculi
Mathematical Structures in Computer Science
A theory of classes: proofs and models
Mathematical Structures in Computer Science
Categorical properties of logical frameworks
Mathematical Structures in Computer Science
Intuitionistic model constructions and normalization proofs
Mathematical Structures in Computer Science
A categorical version of the Brouwer–Heyting–Kolmogorov interpretation
Mathematical Structures in Computer Science
Journal of Functional Programming
The lambda calculus is algebraic
Journal of Functional Programming
Journal of Functional Programming
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
Theoretical Computer Science
Possible worlds and resources: the semantics of BI
Theoretical Computer Science - Mathematical foundations of programming semantics
Isomorphisms of simple inductive types through extensional rewriting
Mathematical Structures in Computer Science
The semantics of BI and resource tableaux
Mathematical Structures in Computer Science
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Mathematical Structures in Computer Science
The HASCASL prologue: categorical syntax and semantics of the partial λ-calculus
Theoretical Computer Science
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
A Local Graph-rewriting System for Deciding Equality in Sum-product Theories
Electronic Notes in Theoretical Computer Science (ENTCS)
Ultraproducts and possible worlds semantics in institutions
Theoretical Computer Science
A comprehensive combination framework
ACM Transactions on Computational Logic (TOCL)
Theoretical Computer Science
A Type Driven Theory of Predication with Complex Types
Fundamenta Informaticae - Logic for Pragmatics
Interpreting Localized Computational Effects Using Operators of Higher Type
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
A Characterisation of Lambda Definability with Sums Via T T-Closure Operators
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
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)
HasCasl: Integrated higher-order specification and program development
Theoretical Computer Science
Monads and Meta-lambda Calculus
New Frontiers in Artificial Intelligence
On traced monoidal closed categories
Mathematical Structures in Computer Science
Monoidal Indeterminates and Categories of Possible Worlds
Electronic Notes in Theoretical Computer Science (ENTCS)
Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
From parametric polymorphism to models of polymorphic fpc
Mathematical Structures in Computer Science
A categorical semantics for fuzzy predicate logic
Fuzzy Sets and Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Inside Every Model of Abstract Stone Duality Lies an Arithmetic Universe
Electronic Notes in Theoretical Computer Science (ENTCS)
Partially additive categories and fully complete models of linear logic
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
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
A wistech paradigm for intelligent systems
Transactions on rough sets VI
Bootstrapping types and cotypes in HASCASL
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Call-by-name and call-by-value in normal modal logic
APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Pillars of computer science
Categorical approaches to non-commutative fuzzy logic
Fuzzy Sets and Systems
Selection functions, bar recursion and backward induction
Mathematical Structures in Computer Science
Some reasons for generalising domain theory
Mathematical Structures in Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Kleisli category and database mappings
International Journal of Intelligent Information and Database Systems
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
Monad transformers as monoid transformers
Theoretical Computer Science
Logic and computation in a lambda calculus with intersection and union types
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
On the 2-categorical view of proofs
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
ICDCIT'11 Proceedings of the 7th international conference on Distributed computing and internet technology
UC'11 Proceedings of the 10th international conference on Unconventional computation
Are (linguists') propositions (topos) propositions?
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
Linearity and iterator types for Gödel's System
Higher-Order and Symbolic Computation
Some New Approaches in Functional Programming Using Algebras and Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Functorial boxes in string diagrams
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Towards self-verification of HOL light
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Combining type theory and untyped set theory
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
A complexity theory of design intentionality
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Alpha-structural recursion and induction
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Using formal methods with SysML in aerospace design and engineering
Annals of Mathematics and Artificial Intelligence
A terminating and confluent linear lambda calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Functional models of neurobiological processes
Mathematical and Computer Modelling: An International Journal
Agnostic possible worlds semantics
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Game Semantics in String Diagrams
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A Type Driven Theory of Predication with Complex Types
Fundamenta Informaticae - Logic for Pragmatics
What is turing's comparison between mechanism and writing worth?
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Constructing applicative functors
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Hyperintensional dynamic semantics: analyzing definiteness with enriched contexts
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Distinguishing phenogrammar from tectogrammar simplifies the analysis of interrogatives
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Weak familiarity and anaphoric accessibility in dynamic semantics
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Adhesive High-Level Replacement Systems: A New Categorical Framework for Graph Transformation
Fundamenta Informaticae - SPECIAL ISSUE ON ICGT 2004
Parameterizations and Fixed-Point Operators on Control Categories
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Relation Between Unambiguous Regular Expressions and Abstract Data Types
Fundamenta Informaticae
A Note On Categories Of Information Systems
Fundamenta Informaticae
A Semantics For Evaluation Logic
Fundamenta Informaticae
Categorical Combinators With Explicit Products
Fundamenta Informaticae
Parameters And Parametrization In Specification, Using Distributive Categories
Fundamenta Informaticae
A Higher-Order Theory of Presupposition
Studia Logica
A games model of bunched implications
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Identities in modular arithmetic from reversible coherence operations
RC'13 Proceedings of the 5th international conference on Reversible Computation
Systems analysis of life cycle of large-scale information-control systems
Automation and Remote Control
Nominal Lambda Calculus: An Internal Language for FM-Cartesian Closed Categories
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Notion of Lambda Monoid
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.01 |