Last edited by Nit
Monday, May 18, 2020 | History

4 edition of Proof-term synthesis on dependent-type systems via explicit substitutions found in the catalog.

Proof-term synthesis on dependent-type systems via explicit substitutions

Proof-term synthesis on dependent-type systems via explicit substitutions

  • 120 Want to read
  • 18 Currently reading

Published by Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, National Technical Information Service, distributor in Hampton, VA, Springfield, VA .
Written in English


Edition Notes

Other titlesProof team synthesis on dependent type systems via explicit substitutions., Proof team synthesis on dependent type systems via explicit substitutions.
StatementCésar Muñoz.
SeriesICASE report -- no. 99-47., [NASA contractor report] -- NASA/CR-1999-209730., NASA contractor report -- NASA CR-209730.
ContributionsInstitute for Computer Applications in Science and Engineering.
The Physical Object
FormatMicroform
Pagination1 v.
ID Numbers
Open LibraryOL17602875M
OCLC/WorldCa44187316

On the (Alleged) Value of Proof for Assurance. I find the work on dependent type interesting and frustrating. ATS and friends can clearly deal with value-dependent properties. A few such properties are comprehensible, most are not. All a tactic has to do is construct a proof term; it's still going to be checked by Coq's kernel. Robert T. Swann and Claud M. Pittman, Numerical Analysis of the Transient Response of Advanced Thermal Protection Systems, NASA TN D, July , pp. Robert J. Pegg, Flight-Test Investigation of Ailerons as a Source of Yaw Control on the VZ-2 Tilt-Wing Aircraft, NASA TN D, July , pp.

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked referencesCited by: Full text of "Types for Proofs and Programs [electronic resource]: third International Workshop, TYPES , Torino, Italy, April 30 - May 4, revised selected papers" See other formats.

Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate result of the program and should therefore. - Given that probability logics, serving as decision-making or decision- .. LFP - a Logical Framework wi.


Share this book
You might also like
Mining in Manitoba.

Mining in Manitoba.

New Testament foundations for Christian evangelism

New Testament foundations for Christian evangelism

Stand proud

Stand proud

Swan Lane School, Evesham

Swan Lane School, Evesham

The Jaguars children

The Jaguars children

Salute to our mangrove giants & other poems

Salute to our mangrove giants & other poems

Arthur Hugh Clough

Arthur Hugh Clough

performance audit of veterinary licensing in Utah

performance audit of veterinary licensing in Utah

Monograph on health expenditures in Indiana, 1982 to 1996.

Monograph on health expenditures in Indiana, 1982 to 1996.

Ancient Court Leet and Court Baron of the manor of Bromsgrove.

Ancient Court Leet and Court Baron of the manor of Bromsgrove.

Church of Saint Michael Bockleton

Church of Saint Michael Bockleton

Medical assistant exam

Medical assistant exam

Berlin 1945

Berlin 1945

An abridgement of the Holy Scriptures

An abridgement of the Holy Scriptures

Deformation of polycrystals: Mechanisms and microstructures

Deformation of polycrystals: Mechanisms and microstructures

Hard times, hard bread, and harder coffee

Hard times, hard bread, and harder coffee

Proof-term synthesis on dependent-type systems via explicit substitutions Download PDF EPUB FB2

Proof-term synthesis on dependent-type systems via explicit substitutions. Author links open overlay panel César Muñoz 1. Show more. In this paper we present a proof synthesis method for dependent-type systems where typed open terms are built incrementally at the same time as proofs are done.

This way, every construction step, not just Cited by: 8. Proof-Term Synthesis on Dependent-Type Systems via Explicit Substitutions [Cesar Munoz] on *FREE* shipping on qualifying offers.

Proof-term synthesis on dependent-type systems via explicit substitutions (SuDoc NAS ) [César Muñoz] on *FREE* shipping on qualifying : César Muñoz. Get this from a library. Proof-term synthesis on dependent-type systems via explicit substitutions.

[César A Muñoz; Institute for Computer Applications in Science and Engineering.]. Proof-term synthesis on dependent-type systems via explicit substitutions [microform] / César Muñoz Institute for Computer Applications in Science and Engineering, NASA Langley Research Center ; National Technical Information Service, distributor Hampton, VA: Springfield, VA Australian/Harvard Citation.

Muñoz, César. Buy Proof-Term Synthesis on Dependent-Type Systems via Explicit Substitutions by Cesar Munoz (ISBN:) from Amazon's Book Store.

Everyday low prices and free delivery on eligible : Cesar Munoz. Abstract: "Explicit substitution calculi are extensions of the [lambda]-calculus where the substitution mechanism is internalized into the theory.

This feature makes them suitable for implementation and theoretical study of logic-based tools such as strongly typed programming languages and. Muñoz, C.: Proof-term synthesis on dependent-type systems via explicit substitutions. Theoretical Computer Science– () MathSciNet zbMATH CrossRef Google Scholar NipCited by: 4.

Abstract. Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type order to express proof-search in such theories, we introduce the Pure Type Sequent Calculi (PTSC) by enriching a sequent calculus due to Herbelin, adapted to proof-search and strongly related to natural are equipped with a normalisation procedure, adapted from Herbelin’s Cited by: 7.

Dependent types and explicit substitutions [microform] / Cesar Munoz Institute for Computer Applications in Science and Engineering, NASA Langley Research Center ; National Technical Information Service, distributor Hampton, VA: Springfield, Va Australian/Harvard Citation.

Muñoz, César. In particular, we show how the Dowek's proof synthesis method for the cube type systems can be adapted to the incomplete proof-term paradigm via a suitable theory with explicit substitutions and Author: Lena Pareto.

maj Prof. dr hab. Marek Zaionc phone: (48 12) Theoretical Computer Science fax: (48 12) Jagiellonian University, secretary: (48 12) ul. Łojasiewicza 6.

Request PDF | A Proof of Strong Normalisation of the Typed Atomic Lambda-Calculus | The atomic lambda-calculus is a typed lambda-calculus with explicit sharing, which originates in a Curry-Howard.

Add open access links from to the list of external document links (if available). load links from Privacy notice: By enabling the option above, your.

and related systems General Terms Reliability, Theory Keywords Type Theory, Pure Type Systems, Conversion Rule, Convertibility Proofs, Formalisation, Coq 1. Introduction Dependent type systems are used as a basis for formalising math-ematics through the well-known Curry-Howard formulas-as.

Proof-Term Synthesis on Dependent-Type Systems via Explicit Substitutions | Cesar Munoz | ISBN: | Kostenloser Versand für alle Bücher mit Versand und Verkauf duch : Taschenbuch.

Compra Proof-Term Synthesis on Dependent-Type Systems via Explicit Substitutions. SPEDIZIONE GRATUITA su ordini idoneiFormat: Copertina flessibile. Noté /5. Retrouvez Proof-Term Synthesis on Dependent-Type Systems via Explicit Substitutions et des millions de livres en stock sur Achetez neuf ou d'occasionFormat: Broché.

10/03/19 - This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lea. 03/13/20 - Development of formal proofs of correctness of programs can increase actual and perceived reliability and facilitate better unders.

In sequential systems, data types o er an e ective basis of assuring a correct evolution. In distributed systems, the behavioural types were introduced to secure the compatibility of interaction patterns among processes [6].

The behavioural type of a process speci es its expectedFile Size: 11MB.Mar 2, - two-level λ-calculus has two level of variable, modelled by nominal 3) the thesis is the correct version of the thesis for submission and is the.

terms (Definition ), and their permissive counterparts, under .[SNO+10] Peter Sewell, Francesco .Full text of "Typed lambda calculi and applications: 5th international conference, TLCAKraków, Poland, Mayproceedings" See other formats.