Skip to main content

and
  1. No Access

    Article

    Strongly Typed Term Representations in Coq

    There are two approaches to formalizing the syntax of typed object languages in a proof assistant or programming language. The extrinsic approach is to first define a type that encodes untyped object expressions ...

    Nick Benton, Chung-Kil Hur, Andrew J. Kennedy in Journal of Automated Reasoning (2012)