A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Strongly typed flow-directed representation transformations (extended abstract)
ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Minimal typings in atomic subtyping
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraints to stop higher-order deforestation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Second-order unification and type inference for Church-style polymorphism
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic typing as staged type inference
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A new approach to generic functional programming
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CPS translating inductive and coinductive types
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
A type system for certified binaries
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
An induction principle for pure type systems
Theoretical Computer Science
Theoretical Computer Science - Special issue on theories of types and proofs
Proof by computation in the Coq system
Theoretical Computer Science - Special issue on theories of types and proofs
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Studies of a Theory of Specifications with Built-in Program Extraction
Journal of Automated Reasoning
Autarkic Computations in Formal Proofs
Journal of Automated Reasoning
Journal of Logic, Language and Information
Contexts in Dynamic Predicate Logic
Journal of Logic, Language and Information
Basic Simple Type Theory, J. Roger Hindley
Journal of Logic, Language and Information
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Journal of Logic, Language and Information
Conservation and uniform normalization in Lambda calculi with erasing reductions
Information and Computation
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A New Implementation of Automath
Journal of Automated Reasoning
CPS Translations and Applications: The Cube and Beyond
Higher-Order and Symbolic Computation
Confluency and strong normalizability of call-by-value λµ-calculus
Theoretical Computer Science
On introducing higher order functions in ABEL
Nordic Journal of Computing
A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
A Monotonic Higher-Order Semantic Path Ordering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Counting a Type's Principal Inhabitants
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Logic for Abstract Data Types as Existential Types
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Pure Type Systems with Subtyping
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Soundness of the Logical Framework for Its Typed Operational Semantics
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
Condensing Lemmas for Pure Type Systems with Universes
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Refining the Barendregt Cube Using Parameters
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Confluence of Untyped Lambda Calculus via Simple Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Parameters in Pure Type Systems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Universal Algebra in Type Theory
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Proof Terms for Simply Typed Higher Order Logic
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Recursive Families of Inductive Types
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
A Higher-Order Calculus for Categories
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Communication Modelling and Context-Dependent Interpretation: An Integrated Approach
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Static Analysis of Modularity of beta-Reduction in the Hyperbalanced lambda-Calculus
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Encoding Object-Z in Isabelle/HOL
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
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
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Normalization and Partial Evaluation
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Multimodal Cooperative Resolution of Referential Expressions in the DenK System
CMC '98 Revised Papers from the Second International Conference on Cooperative Multimodal Communication
Safe Proof Checking in Type Theory with Y
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Open Proofs and Open Terms: A Basis for Interactive Logic
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Information and Computation
Higher-order unification and matching
Handbook of automated reasoning
Handbook of automated reasoning
Proof-assistants using dependent type systems
Handbook of automated reasoning
LICS '96 Proceedings of the 11th 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
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Typing correspondence assertions for communication protocols
Theoretical Computer Science
Generativity and dynamic opacity for abstract types
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Typed operational semantics for higher-order subtyping
Information and Computation
Strong Normalization from Weak Normalization by Translation into the Lambda-I-Calculus
Higher-Order and Symbolic Computation
Intersection types and λ-definability
Mathematical Structures in Computer Science
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Pure type systems with explicit substitution
Mathematical Structures in Computer Science
Perpetuality in a named lambda calculus with explicit substitutions
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
Mathematical Structures in Computer Science
Lambda terms for natural deduction, sequent calculus and cut elimination
Journal of Functional Programming
Type checking dependent (record) types and subtyping
Journal of Functional Programming
Journal of Functional Programming
Journal of Functional Programming
TinkerType: a language for playing with formal systems
Journal of Functional Programming
Intensional polymorphism in type-erasure semantics
Journal of Functional Programming
Monadic encapsulation of effects: a revised approach (extended version)
Journal of Functional Programming
Type-checking injective pure type systems
Journal of Functional Programming
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Higher-order subtyping and its decidability
Information and Computation
Linearization of the lambda-calculus and its relation with intersection type systems
Journal of Functional Programming
Strong normalisation in the π-calculus
Information and Computation
The decidability of a fragment of BB'IW-logic
Theoretical Computer Science - Logic, semantics and theory of programming
THEORETICAL PEARL Church numerals, twice!
Journal of Functional Programming
On equivalence and canonical forms in the LF type theory
ACM Transactions on Computational Logic (TOCL)
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Correspondence assertions for process synchronization in concurrent communications
Journal of Functional Programming
ACM SIGPLAN Notices
Closed reduction: explicit substitutions without $\alpha$-conversion
Mathematical Structures in Computer Science
A type system for certified binaries
ACM Transactions on Programming Languages and Systems (TOPLAS)
Typed $\lambda$-calculi with one binder
Journal of Functional Programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Combining higher-order abstract syntax with first-order abstract syntax in ATS
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Remarks on the equational theory of non-normalizing pure type systems
Journal of Functional Programming
Pure type systems with judgemental equality
Journal of Functional Programming
Syntactic control of concurrency
Theoretical Computer Science - Automata, languages and programming: Logic and semantics (ICALP-B 2004)
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Higher-order beta matching with solutions in long beta-eta normal form
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Investigations on the Dual Calculus
Theoretical Computer Science
A multi-stage language with intensional analysis
Proceedings of the 5th international conference on Generative programming and component engineering
Counting a Type's (Principal) Inhabitants
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Dependent ML An approach to practical programming with dependent types
Journal of Functional Programming
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Higher-Order and Symbolic Computation
Reduction and Conversion Strategies for the Calculus of (co)Inductive Constructions: Part I
Electronic Notes in Theoretical Computer Science (ENTCS)
An abstraction-based genetic programming system
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
A proof-theoretic foundation of abortive continuations
Higher-Order and Symbolic Computation
Enhancing the learning and teaching of functions through programming in ML
Journal of Computing Sciences in Colleges
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive and Coinductive Components of Corecursive Functions in Coq
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
On the building of affine retractions
Mathematical Structures in Computer Science
Strong normalisation in two pure pattern type systems
Mathematical Structures in Computer Science
AURA: a programming language for authorization and audit
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
The Intensional Lambda Calculus
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Tabular Expressions and Total Functional Programming
Implementation and Application of Functional Languages
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
Encoding information flow in Aura
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
A Theorem Prover with Dependent Types for Reasoning about Actions
Proceedings of the 2008 conference on STAIRS 2008: Proceedings of the Fourth Starting AI Researchers' Symposium
Existential Type Systems with No Types in Terms
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Automated deduction for verification
ACM Computing Surveys (CSUR)
Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
ACM Transactions on Computational Logic (TOCL)
Encoding information flow in AURA
ACM SIGPLAN Notices
The Polymorphic Rewriting-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical Program Extraction from Classical Proofs
Electronic Notes in Theoretical Computer Science (ENTCS)
Ramified recurrence with dependent types
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Reductions, intersection types, and explicit substitutions
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
The complexity of β-reduction in low orders
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi 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
Expansion postponement via cut elimination in sequent calculi for pure type systems
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
A cut-free sequent calculus for pure type systems verifying the structural rules of Gentzen/Kleene
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
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
(Co-) iteration for higher-order nested datatypes
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Using theory morphisms for implementing formal methods tools
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Using first-order theorem provers in the Jahob data structure verification system
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Embedding pure type systems in the lambda-pi-calculus modulo
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
In the search of a naive type theory
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Curry-style types for nominal terms
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
(In)consistency of extensions of higher order logic and type theory
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Erasure and polymorphism in pure type systems
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Typing termination in a higher-order concurrent imperative language
Information and Computation
RGP: an open source genetic programming system for the R environment
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Parametricity and dependent types
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Justification logic and history based computation
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Monad transformers as monoid transformers
Theoretical Computer Science
Modeling Contexts with Dependent Types
Fundamenta Informaticae
Scalar System F for Linear-Algebraic λ-Calculus: Towards a Quantum Physical Logic
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability and parametricity in pure type systems
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
Representing model theory in a type-theoretical logical framework
Theoretical Computer Science
Typed self-interpretation by pattern matching
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Intersection types for the resource control lambda calculi
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Least and Greatest Fixed Points in Linear Logic
ACM Transactions on Computational Logic (TOCL)
CIC∧: type-based termination of recursive definitions in the calculus of inductive constructions
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Shared-variable concurrency: a proposal
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
A sequent calculus for type theory
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Consistency and completeness of rewriting in the calculus of constructions
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Guaranteeing resource bounds for component software
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
System description: ATS: a language that combines programming with theorem proving
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Formalized metatheory with terms represented by an indexed family of types
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Justifying algorithms for βη-conversion
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Reducibility and ⊤⊤-lifting for computation types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Decidability of type-checking in the calculus of algebraic constructions with size annotations
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
On the role of type decorations in the calculus of inductive constructions
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Finding resource bounds in the presence of explicit deallocation
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Certified higher-order recursive path ordering
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
A proposal for broad spectrum proof certificates
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Continuous semantics for strong normalization
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
A proof theoretic interpretation of model theoretic hiding
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
The complexity of inhabitation with explicit intersection
Logic and Program Semantics
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
A Computational Interpretation of Parametricity
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Pure type systems with corecursion on streams: from finite to infinitary normalisation
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Counting a Type's (Principal) Inhabitants
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
An Axiomatic System of Parametricity
Fundamenta Informaticae
Positive Recursive Type Assignment
Fundamenta Informaticae
A type system for counting instances of software components
Theoretical Computer Science
Computability closure: ten years later
Rewriting Computation and Proof
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
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
Building decision procedures in the calculus of inductive constructions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Taming non-compositionality using new binders
UC'07 Proceedings of the 6th international conference on Unconventional Computation
Theory and Practice of Logic Programming
Relational Hidden Variables and Non-Locality
Studia Logica
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
System FC with explicit kind equality
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Explicit convertibility proofs in pure type systems
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
25 years of formal proof cultures: some problems, some philosophy, bright future
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
A decidable theory of type assignment
Archive for Mathematical Logic
Proof systems for retracts in simply typed lambda calculus
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Information and Computation
Combining proofs and programs in a dependently typed language
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Early detection of type errors in C++ templates
Proceedings of the ACM SIGPLAN 2014 Workshop on Partial Evaluation and Program Manipulation
Type-Based Productivity of Stream Definitions in the Calculus of Constructions
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 and Termination Properties
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Hi-index | 0.01 |