Corpus ID: 50535060

Elimination with a MotiveConor McBrideDepartment of Computer ScienceUniversity of DurhamAbstract

  title={Elimination with a MotiveConor McBrideDepartment of Computer ScienceUniversity of DurhamAbstract},
  author={Conor McBride},
I present a tactic, BasicElim, for Type Theory based proof systems to apply elimination rules in a reenement setting. Applicable rules are parametric in their conclusion, expressing the leverage hypotheses ~ x yield on any ~ x we choose. represents the motive for an elimination: BasicElim's job is to construct a suited to the goal at hand. If these ~ x inhabit an instance of 's domain, I adopt a technique standard in`folklore', generalizing the ~ x and expressing the restriction by equation. A… Expand


Dependently typed functional programs and their proofs
A Machine-Oriented Logic Based on the Resolution Principle
Deliverables: A Categorial Approach to Program Development in Type Theory
Views: a way for pattern matching to cohabit with data abstraction
Telescopic Mappings in Typed Lambda Calculus
Inverting inductively de ned relations in LEGO
  • Types for Proofs and Programs,
  • 1998
Inverting Inductive Predicates in Coq. In Types for Proofs and Programs, '95, volume 1158 of LNCS
  • 1995
LEGO Proof Development System: User's Man ual
  • Technical Report ECS-LFCS-92-211, Laboratory for Foundations of Computer Science,
  • 1992
First-Order Uni cation by Structural Recursion
  • Submitted to the Journal of Functional Programming,
  • 2001
First-Order Uniication by Structural Recursion
  • Journal of Functional Programming
  • 2001