DeepAI AI Chat
Log In Sign Up

On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms

by   Gopalan Nadathur, et al.

Felty and Miller have described what they claim to be a faithful encoding of the dependently typed lambda calculus LF in the logic of hereditary Harrop formulas, a sublogic of an intuitionistic variant of Church's Simple Theory of Types. Their encoding is based roughly on translating object expressions in LF into terms in a simply typed lambda calculus by erasing dependencies in typing and then recapturing the erased dependencies through the use of predicates. Unfortunately, this idea does not quite work. In particular, we provide a counterexample to the claim that the described encoding is faithful. The underlying reason for the falsity of the claim is that the mapping from dependently typed lambda terms to simply typed ones is not one-to-one and hence the inverse transformation is ambiguous. This observation has a broad implication for other related encodings.


page 1

page 2

page 3


A Logic for Reasoning About LF Specifications

We present a logic named L_LF whose intended use is to formalize propert...

Understanding the Expressive Power of Unhygienic Substitution in Metaprogramming via Combinatory Logic

Recent work on combinatory logic demonstrates a compositional translatio...

Gentzen-Mints-Zucker duality

The Curry-Howard correspondence is often described as relating proofs (i...

SynthETIC: an individual insurance claim simulator with feature control

A simulator of individual claim experience called SynthETIC is described...

Time-Stamped Claim Logic

The main objective of this paper is to define a logic for reasoning abou...

Explicit Auditing

The Calculus of Audited Units (CAU) is a typed lambda calculus resulting...

Lambda Congruences and Extensionality

In this work we provide alternative formulations of the concepts of lamb...