An induction principle for pure type systems
Theoretical Computer Science
Annals of Mathematics and Artificial Intelligence
Some Lambda Calculus and Type Theory Formalized
Journal of Automated Reasoning
Formalizing Synthetic Domain Theory
Journal of Automated Reasoning
An Implementation of LF with Coercive Subtyping & Universes
Journal of Automated Reasoning
A Correspondence between Martin-Löf Type Theory, the Ramified Theory of Types and Pure Type Systems
Journal of Logic, Language and Information
Coherence and Transitivity in Coercive Subtyping
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Mathematical Vernacular and Conceptual Well-Formedness in Mathematical Language
LACL '97 Selected papers from the Second International Conference on Logical Aspects of Computational Linguistics
Soundness of the Logical Framework for Its Typed Operational Semantics
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Universal Algebra in Type Theory
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Weakest Precondition for General Recursive Programs Formalized in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
A Modal Lambda Calculus with Iteration and Case Constructs
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Implementation Techniques for Inductive Types in Plastic
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Protocols between Programs and Proofs
LOPSTR '00 Selected Papers form the 10th International Workshop on Logic Based Program Synthesis and Transformation
An Introduction to Dependent Type Theory
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
Proof-assistants using dependent type systems
Handbook of automated reasoning
Reduction-free normalisation for a polymorphic system
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 General Notion of Realizability
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Mathematical Structures in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
Type-based termination of recursive definitions
Mathematical Structures in Computer Science
Journal of Functional Programming
Journal of Functional Programming
First-order unification by structural recursion
Journal of Functional Programming
Journal of Functional Programming
PAL+: a lambda-free logical framework
Journal of Functional Programming
Faking it Simulating dependent types in Haskell
Journal of Functional Programming
Theoretical Computer Science - Mathematical foundations of programming semantics
Functional pearl: i am not a number--i am a free variable
Haskell '04 Proceedings of the 2004 ACM SIGPLAN workshop on Haskell
Ontological Feedback in Multiagent Systems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
A syntactic approach to eta equality in type theory
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transitivity in coercive subtyping
Information and Computation
A computational view of implicit coercions in type theory
Mathematical Structures in Computer Science
Pure type systems with judgemental equality
Journal of Functional Programming
Eliminating distinctions of class: using prototypes to model virtual classes
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
A verified staged interpreter is a verified compiler
Proceedings of the 5th international conference on Generative programming and component engineering
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Coercive Subtyping via Mappings of Reduction Behaviour
Electronic Notes in Theoretical Computer Science (ENTCS)
Coercions in a polymorphic type system
Mathematical Structures in Computer Science
Hoare type theory, polymorphism and separation1
Journal of Functional Programming
Manifest Fields and Module Mechanisms in Intensional Type Theory
Types for Proofs and Programs
Coercive subtyping in lambda-free logical frameworks
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Weyl's predicative classical mathematics as a logic-enriched type theory
ACM Transactions on Computational Logic (TOCL)
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transitivity in coercive subtyping
Information and Computation
Dependent record types revisited
Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages
A logical framework with dependently typed records
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Weak transitivity in coercive subtyping
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A type-theoretic framework for formal reasoning with different logical foundations
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Weyl's predicative classical mathematics as a logic-enriched 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
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
On strong normalization of the calculus of constructions with type-based termination
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Contextual analysis of word meanings in type-theoretical semantics
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
A strategy for automated meaning negotiation in distributed information retrieval
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
A few constructions on constructors
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
λZ: Zermelo's set theory as a PTS with 4 sorts
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Exploring the regular tree types
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Epigram: practical programming with dependent types
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
A dependently typed framework for static analysis of program execution costs
IFL'05 Proceedings of the 17th international conference on Implementation and Application of Functional Languages
Using a dependently-typed language for expressing ontologies
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Dot-types and their implementation
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
A Logical Framework with Dependently Typed Records
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Formal foundations for situation awareness based on dependent type theory
Information Fusion
Classical program extraction in the calculus of constructions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Coercive subtyping: Theory and implementation
Information and Computation
System FC with explicit kind equality
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Combining proofs and programs in a dependently typed language
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Intensional Type Theory with Guarded Recursive Types qua Fixed Points on Universes
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
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
| Hi-index | 0.01 |