Abstract types have existential type
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Symbolic Computation
Extracting &ohgr;'s programs from proofs in the calculus of constructions
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Relating models of polymorphism
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From operational semantics to abstract machines: preliminary results
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
Extended projection—new method to extract efficient programs from constructive proofs
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Parsers and printers as stream destructors and constructors embedded in functional languages
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Fundamentals of Deductive Program Synthesis
IEEE Transactions on Software Engineering
A framework for defining logics
Journal of the ACM (JACM)
Explicit polymorphism and CPS conversion
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
QPC2: A constructive calculus with parameterized specifications
Journal of Symbolic Computation - Special issue on automatic programming
On the type structure of standard ML
ACM Transactions on Programming Languages and Systems (TOPLAS)
Extending PowerEpsilon with algebraic rewriting
ACM SIGPLAN Notices
Proving properties of programs defined over recursive data structures
PEPM '95 Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Rules and strategies for transforming functional and logic programs
ACM Computing Surveys (CSUR)
Cayenne—a language with dependent types
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Modeling a Hardware Synthesis Methodology in Isabelle
Formal Methods in System Design
A provably correct operating system: &dgr;-core
ACM SIGOPS Operating Systems Review
The minimal model of operating systems
ACM SIGOPS Operating Systems Review
A type system for certified binaries
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Proof-term synthesis on dependent-type systems via explicit substitutions
Theoretical Computer Science
An induction principle for pure type systems
Theoretical Computer Science
A compiled implementation of strong reduction
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Higher order generalization and its application in program verification
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Metalogical Frameworks II: Developing a Reflected Decision Procedure
Journal of Automated Reasoning
A Full Formalization of SLD-Resolution in the Calculus of Inductive Constructions
Journal of Automated Reasoning
Autarkic Computations in Formal Proofs
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
Types for the ambient calculus
Information and Computation - IFIP TCS2000
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
Formal specifications of debuggers
ACM SIGPLAN Notices
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Pure Type Systems with Subtyping
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Condensing Lemmas for Pure Type Systems with Universes
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
ECOOP '99 Proceedings of the 13th European Conference on Object-Oriented Programming
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
Refining the Barendregt Cube Using Parameters
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Nested General Recursion and Partiality in Type Theory
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
The HOL/NuPRL Proof Translator (A Practical Approach to Formal Interoperability)
TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Explicit Universes for the Calculus of Constructions
TPHOLs '02 Proceedings of the 15th 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
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
A Tour with Constructive Real Numbers
TYPES '00 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
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
On Functions and Types: A Tutorial
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
The Calculus of algebraic Constructions
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
A Higher-Order Specification of the pi-Calculus
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
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
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Theory of Judgments and Derivations
Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
P.rex: An Interactive Proof Explainer
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
The Girard-Reynolds Isomorphism
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Programming methodology
Simple general recursion in type theory
Nordic Journal of Computing
Higher-order unification and matching
Handbook of automated reasoning
Proof-assistants using dependent type systems
Handbook of automated reasoning
A formal semantic definition of DEVIL
ACM SIGPLAN Notices
Partitioning based operating system: a formal model
ACM SIGOPS Operating Systems Review
Explicit substitutions in the reduction of lambda terms
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A framework for program development based on schematic proof
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
The Girard--Reynolds isomorphism
Information and Computation - TACS 2001
Syntax-Directed Amorphous Slicing
Automated Software Engineering
Variations on realizability: realizing the propositional axiom of choice
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Some logical and syntactical observations concerning the first-order dependent type system λP
Mathematical Structures in Computer Science
Verification of non-functional programs using interpretations in type theory
Journal of Functional Programming
Termination of rewriting in the Calculus of Constructions
Journal of Functional Programming
A predicative analysis of structural recursion
Journal of Functional Programming
Modularity of strong normalization in the algebraic-λ-cube
Journal of Functional Programming
A Syntactic Approach to Foundational Proof-Carrying Code
Journal of Automated Reasoning
Building certified libraries for PCC: dynamic storage allocation
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
Definitions by rewriting in the Calculus of Constructions
Mathematical Structures in Computer Science
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
Journal of Automated Reasoning
A type system for certified binaries
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation
Typed $\lambda$-calculi with one binder
Journal of Functional Programming
Combining programming with theorem proving
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Modular verification of concurrent assembly code with dynamic thread creation and termination
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A language-based approach to functionally correct imperative programming
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Verifying haskell programs using constructive type theory
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Modular correspondence between dependent type theories and categories including pretopoi and topoi
Mathematical Structures in Computer Science
Pure type systems with judgemental equality
Journal of Functional Programming
GraSp: grammar learning from unlabelled speech corpora
COLING-02 proceedings of the 6th conference on Natural language learning - Volume 20
A certified, corecursive implementation of exact real numbers
Theoretical Computer Science - Real numbers and computers
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
Formal proof of a program: Find
Science of Computer Programming
Inductive types in the Calculus of Algebraic Constructions
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
A Framework for Defining Logical Frameworks
Electronic Notes in Theoretical Computer Science (ENTCS)
The Girard—Reynolds isomorphism (second edition)
Theoretical Computer Science
Programmed Strategies for Program Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternative Logics: a book review: SIGACT news logic column 18
ACM SIGACT News
Computers, Justification, and Mathematical Knowledge
Minds and Machines
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
A coinductive monad for prop-bounded recursion
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications
An IDE for software development using tabular expressions
CASCON '07 Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
Focusing and higher-order abstract syntax
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Computerizing Mathematical Text with MathLang
Electronic Notes in Theoretical Computer Science (ENTCS)
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
'Galculator': functional prototype of a Galois-connection based proof assistant
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
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
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Constrained types for object-oriented languages
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A Type of Partial Recursive Functions
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A Conditional Logical Framework
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
An Interactive Driver for Goal-directed Proof Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Certifying properties of an efficient functional program for computing Gröbner bases
Journal of Symbolic Computation
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
A decision procedure for subset constraints over regular languages
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
An integrated proof language for imperative programs
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
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
A Framework for the Analysis of Access Control Models for Interactive Mobile Devices
Types for Proofs and Programs
Automated deduction for verification
ACM Computing Surveys (CSUR)
ACM Transactions on Computational Logic (TOCL)
A Brief Overview of Agda --- A Functional Language with Dependent Types
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Reasoning about Relations with Dependent Types: Application to Context-Aware Applications
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Weyl's predicative classical mathematics as a logic-enriched type theory
ACM Transactions on Computational Logic (TOCL)
Deductive Runtime Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
A Language for Verification and Manipulation of Web Documents
Electronic Notes in Theoretical Computer Science (ENTCS)
Singleton types here, singleton types there, singleton types everywhere
Proceedings of the 4th ACM SIGPLAN workshop on Programming languages meets program verification
Induction is not derivable in second order dependent type theory
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
Inductive types in the calculus of algebraic constructions
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
Observational equivalence and program extraction in the Coq proof assistant
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
General recursion in type theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Subsets, quotients and partial functions in martin-löf's type theory
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
The not so simple proof-irrelevant model of CC
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
A PVS proof obligation generator for Lustre programs
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Building certified libraries for PCC: dynamic storage allocation
ESOP'03 Proceedings of the 12th European conference on Programming
Intuitionistic refinement calculus
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
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
A verification framework for agent knowledge
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Policies and proofs for code auditing
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
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
Combining de Bruijn indices and higher-order abstract syntax in Coq
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
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Service oriented architectural design
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Declarative modeling of finite mathematics
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A computer-verified monadic functional implementation of the integral
Theoretical Computer Science
Industrial-strength certified SAT solving through verified SAT proof checking
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
On arithmetic computations with hereditarily finite sets, functions and types
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Fibrational induction rules for initial algebras
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Refinement types for secure implementations
ACM Transactions on Programming Languages and Systems (TOPLAS)
A unified formal description of arithmetic and set theoretical data types
AISC'10/MKM'10/Calculemus'10 Proceedings of the 10th ASIC and 9th MKM international conference, and 17th Calculemus conference on Intelligent computer mathematics
Modeling Contexts with Dependent Types
Fundamenta Informaticae
An evaluation of automata algorithms for string analysis
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Theoretical Computer Science
Dependent session types via intuitionistic linear type theory
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Representing model theory in a type-theoretical logical framework
Theoretical Computer Science
Computer certified efficient exact reals in Coq
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Verifying and invalidating textbook proofs using scunak
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Typed compilation against non-manifest base classes
CASSIS'05 Proceedings of the Second international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
A sequent calculus for type theory
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Representing and reasoning with operational semantics
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Towards a certified and efficient computing of gröbner bases
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
An extended type system for OCL supporting templates and transformations
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Formalising bitonic sort in type theory
TYPES'04 Proceedings of the 2004 international conference on Types for Proofs and Programs
Metareasoning for multi-agent epistemic logics
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Recursive functions with higher order domains
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
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
Using formal methods with SysML in aerospace design and engineering
Annals of Mathematics and Artificial Intelligence
Higher-order aspects and context in SUMO
Web Semantics: Science, Services and Agents on the World Wide Web
A mechanized translation from higher-order logic to set theory
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Using a dependently-typed language for expressing ontologies
KSEM'11 Proceedings of the 5th international conference on Knowledge Science, Engineering and Management
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Adding equations to system f types
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Verification games: making verification fun
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Dot-types and their implementation
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
xmonad in Coq (experience report): programming a window manager in a proof assistant
Proceedings of the 2012 Haskell Symposium
Proof-producing synthesis of ML from higher-order logic
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
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
Formal foundations for situation awareness based on dependent type theory
Information Fusion
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
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
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
Type-specialized staged programming with process separation
Higher-Order and Symbolic Computation
Alternating-Time temporal logic in the calculus of (co)inductive constructions
SBMF'12 Proceedings of the 15th Brazilian conference on Formal Methods: foundations and applications
A Two-Valued Logic for Properties of Strict Functional Programs Allowing Partial Functions
Journal of Automated Reasoning
Rely-guarantee references for refinement types over aliased mutable data
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Information and Computation
A machine-checked proof of the odd order theorem
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A relationally parametric model of dependent type theory
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Binary trees as a computational framework
Computer Languages, Systems and Structures
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
| Hi-index | 0.01 |