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

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 exp...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-08
Main Authors: Nadathur, Gopalan, Southern, Mary
Format: Article
Language:English
Subjects:
Predicate logic
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Nadathur, Gopalan
Southern, Mary
description 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.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2564320251</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2564320251</sourcerecordid><originalsourceid>FETCH-proquest_journals_25643202513</originalsourceid><addsrcrecordid>eNqNykELgjAYgOERBEn5Hz7oLMxvzjoXSgehIO-ytiUT3WzTwH9fh35Ap_fwvCsSIWNpcswQNyQOoaOUYn5AzllETlcLhZVOGdtCVYKxIODmtTJSTBoq1xoJ7q093M0w9ktSL6NWUInhoQTU2g9hR9ZP0Qcd_7ol-7Koz5dk9O416zA1nZu9_VKDPM8YUuQp--_6AORzOCk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2564320251</pqid></control><display><type>article</type><title>On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms</title><source>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</source><creator>Nadathur, Gopalan ; Southern, Mary</creator><creatorcontrib>Nadathur, Gopalan ; Southern, Mary</creatorcontrib><description>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.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Predicate logic</subject><ispartof>arXiv.org, 2021-08</ispartof><rights>2021. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2564320251?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Nadathur, Gopalan</creatorcontrib><creatorcontrib>Southern, Mary</creatorcontrib><title>On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms</title><title>arXiv.org</title><description>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.</description><subject>Predicate logic</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNykELgjAYgOERBEn5Hz7oLMxvzjoXSgehIO-ytiUT3WzTwH9fh35Ap_fwvCsSIWNpcswQNyQOoaOUYn5AzllETlcLhZVOGdtCVYKxIODmtTJSTBoq1xoJ7q093M0w9ktSL6NWUInhoQTU2g9hR9ZP0Qcd_7ol-7Koz5dk9O416zA1nZu9_VKDPM8YUuQp--_6AORzOCk</recordid><startdate>20210824</startdate><enddate>20210824</enddate><creator>Nadathur, Gopalan</creator><creator>Southern, Mary</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20210824</creationdate><title>On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms</title><author>Nadathur, Gopalan ; Southern, Mary</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_25643202513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Predicate logic</topic><toplevel>online_resources</toplevel><creatorcontrib>Nadathur, Gopalan</creatorcontrib><creatorcontrib>Southern, Mary</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Nadathur, Gopalan</au><au>Southern, Mary</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms</atitle><jtitle>arXiv.org</jtitle><date>2021-08-24</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>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.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-08
issn 2331-8422
language eng
recordid cdi_proquest_journals_2564320251
source Publicly Available Content Database (Proquest) (PQ_SDU_P3)
subjects Predicate logic
title On Encoding LF in a Predicate Logic over Simply-Typed Lambda Terms
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A18%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=On%20Encoding%20LF%20in%20a%20Predicate%20Logic%20over%20Simply-Typed%20Lambda%20Terms&rft.jtitle=arXiv.org&rft.au=Nadathur,%20Gopalan&rft.date=2021-08-24&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2564320251%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_25643202513%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2564320251&rft_id=info:pmid/&rfr_iscdi=true