Synthesis of ML programs in the system Coq
Journal of Symbolic Computation - Special issue on automatic programming
Typing algorithm in type theory with inheritance
Proceedings of the 24th 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
Primitive recursion for higher-order abstract syntax
Theoretical Computer Science
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
Least and greatest fixed points in intuitionistic natural deduction
Theoretical Computer Science - Special issue on theories of types and proofs
An expressive, scalable type theory for certified code
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Tagless staged interpreters for typed languages
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
External Rewriting for Skeptical Proof Assistants
Journal of Automated Reasoning
Journal of Automated Reasoning
Encoding Intensional Type Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
A Logic for Abstract Data Types as Existential Types
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A Finite Axiomatization of Inductive-Recursive Definitions
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
TPHOLs '99 Proceedings of the 12th 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
Fix-Point Equations for Well-Founded Recursion in Type Theory
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Efficient Reasoning about Executable Specifications in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
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
A Co-inductive Approach to Real Numbers
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
Changing Data Structures in Type Theory: A Study of Natural Numbers
TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Rewriting Logic as a Metalogical Framework
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Tradeoffs in the Intensional Representation of Lambda Terms
RTA '02 Proceedings of the 13th 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
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
Formal Program Development in Geometric Modeling
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
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
Recursion for Higher-Order Encodings
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Hardware Verification Using Co-induction in COQ
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Higher-order unification and matching
Handbook of automated reasoning
Handbook of automated reasoning
Proof-assistants using dependent type systems
Handbook of automated reasoning
The Synthesis of a Java Card Tokenization Algorithm
Proceedings of the 16th IEEE international conference on Automated software engineering
Recursion over objects of functional type
Mathematical Structures in Computer Science
Final coalgebras as greatest fixed points in ZF set theory
Mathematical Structures in Computer Science
Type-based termination of recursive definitions
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 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)
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
Verification of safety properties for concurrent assembly code
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
A type system for certified binaries
ACM Transactions on Programming Languages and Systems (TOPLAS)
Transitivity in coercive subtyping
Information and Computation
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
Isomorphisms of simple inductive types through extensional rewriting
Mathematical Structures in Computer Science
Certified assembly programming with embedded code pointers
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A very modal model of a modern, major, general type system
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An open framework for foundational proof-carrying code
TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Affine functions and series with co-inductive real numbers
Mathematical Structures in Computer Science
Constructive analysis, types and exact real numbers
Mathematical Structures in Computer Science
Integrating a certified memory management runtime with proof-carrying code
Proceedings of the 2007 ACM symposium on Applied computing
A general framework for certifying garbage collectors and their mutators
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Program-ing finger trees in Coq
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
PLPV '07 Proceedings of the 2007 workshop on Programming languages meets program verification
Garbage collector verification for proof-carrying code
Journal of Computer Science and Technology
Foundational certified code in the Twelf metalogical framework
ACM Transactions on Computational Logic (TOCL)
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
Inductive and Coinductive Components of Corecursive Functions in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Experimenting Formal Proofs of Petri Nets Refinements
Electronic Notes in Theoretical Computer Science (ENTCS)
Fixed point semantics and partial recursion in Coq
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
Theoretical Computer Science
Recursion on Nested Datatypes in Dependent Type Theory
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Logic-Free Reasoning in Isabelle/Isar
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Combining Domain-Specific and Foundational Logics to Verify Complete Software Systems
VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
A foundation for flow-based program matching: using temporal logic and model checking
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 3rd workshop on Programming languages meets program verification
Journal of Automated Reasoning
A New Elimination Rule for the Calculus of Inductive Constructions
Types for Proofs and Programs
Dual Calculus with Inductive and Coinductive Types
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Automated deduction for verification
ACM Computing Surveys (CSUR)
Reasoning with hypothetical judgments and open terms in hybrid
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Practical Tactics for Separation Logic
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Transitivity in coercive subtyping
Information and Computation
Theoretical Computer Science
Observational equivalence and program extraction in the Coq proof assistant
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
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
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
On the representation of imperative programs in a logical framework
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Ur: statically-typed metaprogramming with type-level record computation
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Parametricity, type equality, and higher-order polymorphism
Journal of Functional Programming
Parametricity and dependent types
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Formally certified stable marriages
Proceedings of the 48th Annual Southeast Regional Conference
Singleton: a general-purpose dependently-typed assembly language
Proceedings of the 7th ACM SIGPLAN workshop on Types in language design and implementation
Decidability and undecidability results for propositional schemata
Journal of Artificial Intelligence Research
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Journal of Automated Reasoning
Higher-order termination: from kruskal to computability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Programming with binders and indexed data-types
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
Consistency and completeness of rewriting in the calculus of constructions
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Filters on coinductive streams, an application to eratosthenes' sieve
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Privacy in data mining using formal methods
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
The ∇-calculus. functional programming with higher-order encodings
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
Inductive consequences in the calculus of constructions
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
On the confluence of the graphic calculus with penrose diagrams (i)
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Reasoning on schemata of formulæ
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Inductive Types in Homotopy Type Theory
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
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
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Fundamenta Informaticae - Behavior of Composed Concurrent Systems: Logic and Reasoning
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
Deciding regular expressions (in-)equivalence in coq
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Rely-guarantee references for refinement types over aliased mutable data
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Formal verification of change making algorithms
Proceedings of the 51st ACM Southeast Conference
Crowd-scale interactive formal reasoning and analytics
Proceedings of the 26th annual ACM symposium on User interface software and technology
Extending Type Inference to Variational Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |