Implementing mathematics with the Nuprl proof development system
Implementing mathematics with the Nuprl proof development system
Natural deduction as higher-order resolution
Journal of Logic Programming
Information and Computation - Semantics of Data Types
The definition of Standard ML
Information and Computation
An overview of the Edinburgh logical framework
Current trends in hardware verification and automated theorem proving
Type systems for programming languages
Handbook of theoretical computer science (vol. B)
Logical frameworks
Logic programming in the LF logical framework
Logical frameworks
Operational semantics in a natural deduction setting
Logical frameworks
An algorithm for testing conversion in type theory
Logical frameworks
Proof-search in the &lgr;II-calculus
Logical frameworks
Using typed lambda calculus to implement formal systems on a machine
Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constructions: A Higher Order Proof System for Mechanizing Mathematics
EUROCAL '85 Invited Lectures from the European Conference on Computer Algebra-Volume I - Volume I
An Environment for Formal Systems
An Environment for Formal Systems
Specifying and implementing theorem provers in a higher-order logic programming language
Specifying and implementing theorem provers in a higher-order logic programming language
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Operational semantics-directed compilers and machine architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
IDL '94 Proceedings of the workshop on Interface definition languages
A logical framework for software proof reuse
SSR '95 Proceedings of the 1995 Symposium on Software reusability
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design and implementation of a certifying compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Cayenne—a language with dependent types
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Dependent types in practical programming
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Type fixpoints: iteration vs. recursion
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
A semantic model of types and machine instructions for proof-carrying code
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Foundational aspects of syntax
ACM Computing Surveys (CSUR)
A certifying compiler for Java
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Oracle-based checking of untrusted software
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-Order and Symbolic Computation
Reasoning with higher-order abstract syntax in a logical framework
ACM Transactions on Computational Logic (TOCL)
Primitive recursion for higher-order abstract syntax
Theoretical Computer Science
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
An indexed model of recursive types for foundational proof-carrying code
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
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
Labelled Modal Logics: Quantifiers
Journal of Logic, Language and Information
Toward a foundational typed assembly language
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automated techniques for provably safe mobile code
Theoretical Computer Science - Dependable computing
An Authoring Tool for Informal and Formal Requirements Specifications
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
A Type-Theoretic Approach to Induction with Higher-Order Encodings
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Scalable Architecture for Proof-Carrying Code
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
Proving Syntactic Properties of Exceptions in an Ordered Logical Framework
FLOPS '01 Proceedings of the 5th International Symposium on Functional and Logic Programming
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Amalgamation in CASL via Enriched Signatures
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Sequent Schema for Derived Rules
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
Algorithms for Equality and Unification in the Presence of Notational Definitions
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Specification and Verification of a Formal System for Structurally Recursive Functions
TYPES '99 Selected papers from the International Workshop on Types for Proofs and Programs
A Kripke-Style Model for the Admissibility of Structural Rules
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
Rewriting Logic as a Metalogical Framework
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A Framework for Developing Embeddable Customized Logics
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Using Linear Logic to Reason about Sequent Systems
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
CAL: A Computer Assisted Learning System for Computation and Logic
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
General Recursion on Second Order Term Algebras
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Tradeoffs in the Intensional Representation of Lambda Terms
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Scalable Certification for Typed Assembly Language
TIC '00 Selected papers from the Third International Workshop on Types in Compilation
A Language-Based Approach to Security
Informatics - 10 Years Back. 10 Years Ahead.
An Introduction to Dependent Type Theory
Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Abstract Syntax for Variable Binders: An Overview
CL '00 Proceedings of the First International Conference on Computational Logic
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Temporal-Safety Proofs for Systems Code
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CVC: A Cooperating Validity Checker
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Kripke Resource Models of a Dependently-Typed, Bunched lambda-Calculus
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Elimination of Negation in a Logical Framework
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Recursion for Higher-Order Encodings
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
Safe, Untrusted Agents Using Proof-Carrying Code
Mobile Agents and Security
Termination and Reduction Checking for Higher-Order Logic Programs
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
Natural Deduction for Intuitionistic Non-communicative Linear Logic
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
A General and Flexible Access-Control System for the Web
Proceedings of the 11th USENIX Security Symposium
Two-Level Meta-reasoning in Coq
TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Programming methodology
Information and Computation
Implementing typeful program transformations
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
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
Reduction-free normalisation for a polymorphic system
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Explicit substitutions in the reduction of lambda terms
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Foundational proof checkers with small witnesses
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Policy-enforced linking of untrusted components
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Recursion over objects of functional type
Mathematical Structures in Computer Science
Dependent types and explicit substitutions: a meta-theoretical development
Mathematical Structures in Computer Science
Some logical and syntactical observations concerning the first-order dependent type system λP
Mathematical Structures in Computer Science
Categorical properties of logical frameworks
Mathematical Structures in Computer Science
Dependent types ensure partial correctness of theorem provers
Journal of Functional Programming
Journal of Functional Programming
TinkerType: a language for playing with formal systems
Journal of Functional Programming
A predicative analysis of structural recursion
Journal of Functional Programming
Journal of Automated Reasoning
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Verifying CPS transformations in Isabelle/HOL
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Representing reductions of NP-complete problems in logical frameworks: a case study
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
A modal foundation for meta-variables
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Abstracting refinements for transformation
Nordic Journal of Computing
Polymorphic lemmas and definitions in $\lambda$Prolog and Twelf
Theory and Practice of Logic Programming
The design and implementation of a certifying compiler
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Reflective metalogical frameworks
ACM Transactions on Computational Logic (TOCL)
The open verifier framework for foundational verifiers
TLDI '05 Proceedings of the 2005 ACM SIGPLAN international workshop on Types in languages design and implementation
On equivalence and canonical forms in the LF type theory
ACM Transactions on Computational Logic (TOCL)
Substitution in non-wellfounded syntax with variable binding
Theoretical Computer Science - Selected papers of CMCS'03
Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
Journal of Automated Reasoning
ACM SIGPLAN Notices
Amalgamation in the semantics of CASL
Theoretical Computer Science - Automata, languages and programming
A language-based approach to functionally correct imperative programming
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
A computational approach to reflective meta-reasoning about languages with bindings
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Verifying Termination and Reduction Properties about Higher-Order Logic Programs
Journal of Automated Reasoning
Consistency of the theory of contexts
Journal of Functional Programming
Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflection
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Higher-order abstract syntax: setting the record straight
ACM SIGACT News
Towards a mechanized metatheory of standard ML
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Implementing Typeful Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
A Framework for Defining Logical Frameworks
Electronic Notes in Theoretical Computer Science (ENTCS)
Hybridizing a Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Practical Reflection for Sequent Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Encoding Functional Relations in Scunak
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts
Journal of Automated Reasoning
Functional Programming With Higher-order Abstract Syntax and Explicit Substitutions
Electronic Notes in Theoretical Computer Science (ENTCS)
An End-To-End Approach to Distributed Policy Language Implementation
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanizing metatheory in a logical framework
Journal of Functional Programming
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Focusing the Inverse Method for LF: A Preliminary Report
Electronic Notes in Theoretical Computer Science (ENTCS)
A Bidirectional Refinement Type System for LF
Electronic Notes in Theoretical Computer Science (ENTCS)
Signature Compilation for the Edinburgh Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Imperative LF Meta-Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Specifying Properties of Concurrent Computations in CLF
Electronic Notes in Theoretical Computer Science (ENTCS)
Normalization for the Simply-Typed Lambda-Calculus in Twelf
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A Meta Linear Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Foundational certified code in the Twelf metalogical framework
ACM Transactions on Computational Logic (TOCL)
ACM Transactions on Computational Logic (TOCL)
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Programming with proofs and explicit contexts
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
A framework for checking proofs naturally
Journal of Intelligent Information Systems
SASyLF: an educational proof assistant for language theory
Proceedings of the 2008 international workshop on Functional and declarative programming in education
Meta-Logical Frameworks and Formal Digital Libraries
Verified Software: Theories, Tools, Experiments
Celf --- A Logical Framework for Deductive and Concurrent Systems (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
THF0 --- The Core of the TPTP Language for Higher-Order Logic
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Proceedings of the 3rd workshop on Programming languages meets program verification
Proceedings of the 3rd workshop on Programming languages meets program verification
Embedding a logical theory of constructions in Agda
Proceedings of the 3rd workshop on Programming languages meets program verification
A generic type-and-effect system
Proceedings of the 4th international workshop on Types in language design and implementation
A Conditional Logical Framework
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Imogen: Focusing the Polarized Inverse Method for Intuitionistic Propositional Logic
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Explicit Contexts in LF (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reasoning in Abella about Structural Operational Semantics Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
System Description: Delphin -- A Functional Programming Language for Deductive Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Case Analysis of Higher-Order Data
Electronic Notes in Theoretical Computer Science (ENTCS)
SMT '08/BPR '08 Proceedings of the Joint Workshops of the 6th International Workshop on Satisfiability Modulo Theories and 1st International Workshop on Bit-Precise Reasoning
A rewriting logic approach to operational semantics
Information and Computation
xDomain: cross-border proofs of access
Proceedings of the 14th ACM symposium on Access control models and technologies
A Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Refinement Types as Proof Irrelevance
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Higher-order abstract syntax in classical higher-order logic
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
A syntactic account of singleton types via hereditary substitution
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
A practical module system for LF
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Higher-order constraint simplification in dependent type theory
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
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)
Representing Model Theory in a Type-Theoretical Logical Framework
Electronic Notes in Theoretical Computer Science (ENTCS)
Validated Proof-Producing Decision Procedures
Electronic Notes in Theoretical Computer Science (ENTCS)
Deductive Runtime Certification
Electronic Notes in Theoretical Computer Science (ENTCS)
Plug and Play the Theory of Contexts in Higher-Order Abstract Syntax
Electronic Notes in Theoretical Computer Science (ENTCS)
A verified compiler for an impure functional language
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
Electronic Notes in Theoretical Computer Science (ENTCS)
A Language for Verification and Manipulation of Web Documents
Electronic Notes in Theoretical Computer Science (ENTCS)
Distributed programming with distributed authorization
Proceedings of the 5th ACM SIGPLAN workshop on Types in language design and implementation
A case study on formalizing algebra in a module system
Proceedings of the 1st Workshop on Modules and Libraries for Proof Assistants
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
External and internal syntax of the λ-calculus
Journal of Symbolic Computation
A consistent semantics of self-adjusting computation
ESOP'07 Proceedings of the 16th European conference on Programming
Data access specification and the most powerful symbolic attacker in MSR
ISSS'02 Proceedings of the 2002 Mext-NSF-JSPS international conference on Software security: theories and systems
Embedding pure type systems in the lambda-pi-calculus modulo
TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
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
A certified distributed security logic for authorizing code
TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Proof pearl: the power of higher-order encodings in the logical framework LF
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Practical programming with higher-order encodings and dependent types
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Electronic Elections: Trust Through Engineering
RE-VOTE '09 Proceedings of the 2009 First International Workshop on Requirements Engineering for e-Voting Systems
Relating nominal and higher-order abstract syntax specifications
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
A meta-programming approach to realizing dependently typed logic programming
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Journal of Automated Reasoning
Tools for multilingual grammar-based translation on the web
ACLDemos '10 Proceedings of the ACL 2010 System Demonstrations
Outrageous but meaningful coincidences: dependent type-safe syntax and evaluation
Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
Higher-order representation of substructural logics
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
VeriML: typed computation of logical terms inside a language with effects
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Mechanizing the metatheory of LF
ACM Transactions on Computational Logic (TOCL)
Proof-theoretic and higher-order extensions of logic programming
A 25-year perspective on logic programming
Information and Computation
Implementing controlled languages in GF
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Reasoning about computations using two-levels of logic
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Programming inductive proofs: a new approach based on contextual types
Verification, induction termination analysis
Programming inductive proofs: a new approach based on contextual types
Verification, induction termination analysis
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
A foundational view on integration problems
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Combining source, content, presentation, narration, and relational representation
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
The rewriting logic semantics project: a progress report
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Alternate annotation checkers using fractional permissions
Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Verifying and invalidating textbook proofs using scunak
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Journal of Automated Reasoning
An executable formalization of the HOL/Nuprl connection in the metalogical framework twelf
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Semantic subtyping: challenges, perspectives, and open problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
On the specification of sequent systems
LPAR'05 Proceedings of the 12th 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
Overcoming performance barriers: efficient verification techniques for logical frameworks
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Extending the TPTP language to higher-order logic with automated parser generation
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
Eliminating redundancy in higher-order unification: a lightweight approach
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Tabling for higher-order logic programming
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Untyped algorithmic equality for martin-löf's logical framework with surjective pairs
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Device-enabled authorization in the grey system
ISC'05 Proceedings of the 8th international conference on Information Security
Beluga: programming with dependent types, contextual data, and contexts
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
Beluga: a framework for programming and reasoning with deductive systems (system description)
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Reasoning with higher-order abstract syntax and contexts: a comparison
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Higher-Order abstract syntax in Isabelle/HOL
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A proof theoretic interpretation of model theoretic hiding
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Towards logical frameworks in the heterogeneous tool set hets
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
GMETA: a generic formal metatheory framework for first-order representations
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Combining interactive and automatic reasoning in first order theories of functional programs
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Formalizing Adequacy: A Case Study for Higher-order Abstract Syntax
Journal of Automated Reasoning
A Canonical Locally Named Representation of Binding
Journal of Automated Reasoning
A Two-Level Logic Approach to Reasoning About Computations
Journal of Automated Reasoning
Strongly Typed Term Representations in Coq
Journal of Automated Reasoning
Extending MKM formats at the statement level
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
A query language for formal mathematical libraries
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Management of change in declarative languages
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
A theory independent curry-de bruijn-howard correspondence
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
A pattern for almost homomorphic functions
Proceedings of the 8th ACM SIGPLAN workshop on Generic programming
LFP: a logical framework with external predicates
Proceedings of the seventh international workshop on Logical frameworks and meta-languages, theory and practice
Tutorial Examples of the Semantic Approach to Foundational Proof-Carrying Code
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Untyped Algorithmic Equality for Martin-Löf's Logical Framework with Surjective Pairs
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2005, Selected Papers
Implementing Typeful Program Transformations
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 2
A Subtyping for Extensible, Incomplete Objects
Fundamenta Informaticae
An Axiomatic System of Parametricity
Fundamenta Informaticae
Compiling contextual objects: bringing higher-order abstract syntax to programmers
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
SMT proof checking using a logical framework
Formal Methods in System Design
The Mizar Mathematical Library in OMDoc: Translation and Applications
Journal of Automated Reasoning
A formal framework for specifying sequent calculus proof systems
Theoretical Computer Science
Mtac: a monad for typed tactic programming in Coq
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
First-class substitutions in contextual type theory
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Explicit convertibility proofs in pure type systems
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Structural logical relations with case analysis and equality reasoning
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Towards extracting explicit proofs from totality checking in twelf
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 logical correspondence between natural semantics and abstract machines
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Finite type extensions in constraint programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Information and Computation
The MMT API: a generic MKM system
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Logical relations for a logical framework
ACM Transactions on Computational Logic (TOCL)
The rewriting logic semantics project: A progress report
Information and Computation
Mechanizing Metatheory Without Typing Contexts
Journal of Automated Reasoning
| Hi-index | 0.01 |
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed &lgr;-calculus with dependent types. Syntax is treated in a style similar to, but more general than, Martin-Lo¨f's system of arities. The treatment of rules and proofs focuses on his notion of a judgment. Logics are represented in LF via a new principle, the judgments as types principle, whereby each judgment is identified with the type of its proofs. This allows for a smooth treatment of discharge and variable occurence conditions and leads to a uniform treatment of rules and proofs whereby rules are viewed as proofs of higher-order judgments and proof checking is reduced to type checking. The practical benefit of our treatment of formal systems is that logic-independent tools, such as proof editors and proof checkers, can be constructed.