Evaluation logic:
Abstract: "A new typed, higher-order logic is described which appears particularly well fitted to reasoning about forms of computation whose operational behaviour can be specified using the Natural Semantics style of structural operational semantics [5]. The logic's underlying type system...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge
1990
|
Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
198 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A new typed, higher-order logic is described which appears particularly well fitted to reasoning about forms of computation whose operational behaviour can be specified using the Natural Semantics style of structural operational semantics [5]. The logic's underlying type system is Moggi's computational metalanguage [11], which enforces a distinction between computations and values via the categorical structure of a strong monad. This is extended to a (constructive) predicate logic with modal formulas about evaluation of computations to values, called evaluation modalities. The categorical structure corresponding to this kind of logic is explained and a couple of examples of categorical models given As a first example of the naturalness and applicability of this new logic to program semantic, we investigate the translation of a (tiny) fragment of Standrd ML into a theory over the logic, which is proved computationally adequate for ML's Natural Semantics [10]. Whilst it is tiny, the ML fragment does however contain both higher-order functional and imperative features, about which the logic allows us to reason without having to mention global states explicitly. |
Beschreibung: | 31 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010411313 | ||
003 | DE-604 | ||
005 | 20150422 | ||
007 | t | ||
008 | 951006s1990 |||| 00||| engod | ||
035 | |a (OCoLC)24313680 | ||
035 | |a (DE-599)BVBBV010411313 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-19 | ||
084 | |a DAT 540f |2 stub | ||
100 | 1 | |a Pitts, Andrew M. |d 1956- |e Verfasser |0 (DE-588)1069892432 |4 aut | |
245 | 1 | 0 | |a Evaluation logic |
264 | 1 | |a Cambridge |c 1990 | |
300 | |a 31 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Computer Laboratory <Cambridge>: Technical report |v 198 | |
520 | 3 | |a Abstract: "A new typed, higher-order logic is described which appears particularly well fitted to reasoning about forms of computation whose operational behaviour can be specified using the Natural Semantics style of structural operational semantics [5]. The logic's underlying type system is Moggi's computational metalanguage [11], which enforces a distinction between computations and values via the categorical structure of a strong monad. This is extended to a (constructive) predicate logic with modal formulas about evaluation of computations to values, called evaluation modalities. The categorical structure corresponding to this kind of logic is explained and a couple of examples of categorical models given | |
520 | 3 | |a As a first example of the naturalness and applicability of this new logic to program semantic, we investigate the translation of a (tiny) fragment of Standrd ML into a theory over the logic, which is proved computationally adequate for ML's Natural Semantics [10]. Whilst it is tiny, the ML fragment does however contain both higher-order functional and imperative features, about which the logic allows us to reason without having to mention global states explicitly. | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Information theory |2 sigle | |
650 | 7 | |a Mathematical sciences |2 sigle | |
650 | 4 | |a Logic programming | |
650 | 4 | |a ML (Computer program language) | |
830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 198 |w (DE-604)BV004055605 |9 198 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006933273 |
Datensatz im Suchindex
_version_ | 1804124839572668416 |
---|---|
any_adam_object | |
author | Pitts, Andrew M. 1956- |
author_GND | (DE-588)1069892432 |
author_facet | Pitts, Andrew M. 1956- |
author_role | aut |
author_sort | Pitts, Andrew M. 1956- |
author_variant | a m p am amp |
building | Verbundindex |
bvnumber | BV010411313 |
classification_tum | DAT 540f |
ctrlnum | (OCoLC)24313680 (DE-599)BVBBV010411313 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02249nam a2200361 cb4500</leader><controlfield tag="001">BV010411313</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20150422 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951006s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24313680</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010411313</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-19</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pitts, Andrew M.</subfield><subfield code="d">1956-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1069892432</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Evaluation logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">31 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">198</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A new typed, higher-order logic is described which appears particularly well fitted to reasoning about forms of computation whose operational behaviour can be specified using the Natural Semantics style of structural operational semantics [5]. The logic's underlying type system is Moggi's computational metalanguage [11], which enforces a distinction between computations and values via the categorical structure of a strong monad. This is extended to a (constructive) predicate logic with modal formulas about evaluation of computations to values, called evaluation modalities. The categorical structure corresponding to this kind of logic is explained and a couple of examples of categorical models given</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">As a first example of the naturalness and applicability of this new logic to program semantic, we investigate the translation of a (tiny) fragment of Standrd ML into a theory over the logic, which is proved computationally adequate for ML's Natural Semantics [10]. Whilst it is tiny, the ML fragment does however contain both higher-order functional and imperative features, about which the logic allows us to reason without having to mention global states explicitly.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer software</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Information theory</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Mathematical sciences</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">ML (Computer program language)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">198</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">198</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006933273</subfield></datafield></record></collection> |
id | DE-604.BV010411313 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:52:03Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006933273 |
oclc_num | 24313680 |
open_access_boolean | |
owner | DE-19 DE-BY-UBM |
owner_facet | DE-19 DE-BY-UBM |
physical | 31 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series | Computer Laboratory <Cambridge>: Technical report |
series2 | Computer Laboratory <Cambridge>: Technical report |
spelling | Pitts, Andrew M. 1956- Verfasser (DE-588)1069892432 aut Evaluation logic Cambridge 1990 31 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 198 Abstract: "A new typed, higher-order logic is described which appears particularly well fitted to reasoning about forms of computation whose operational behaviour can be specified using the Natural Semantics style of structural operational semantics [5]. The logic's underlying type system is Moggi's computational metalanguage [11], which enforces a distinction between computations and values via the categorical structure of a strong monad. This is extended to a (constructive) predicate logic with modal formulas about evaluation of computations to values, called evaluation modalities. The categorical structure corresponding to this kind of logic is explained and a couple of examples of categorical models given As a first example of the naturalness and applicability of this new logic to program semantic, we investigate the translation of a (tiny) fragment of Standrd ML into a theory over the logic, which is proved computationally adequate for ML's Natural Semantics [10]. Whilst it is tiny, the ML fragment does however contain both higher-order functional and imperative features, about which the logic allows us to reason without having to mention global states explicitly. Computer software sigle Information theory sigle Mathematical sciences sigle Logic programming ML (Computer program language) Computer Laboratory <Cambridge>: Technical report 198 (DE-604)BV004055605 198 |
spellingShingle | Pitts, Andrew M. 1956- Evaluation logic Computer Laboratory <Cambridge>: Technical report Computer software sigle Information theory sigle Mathematical sciences sigle Logic programming ML (Computer program language) |
title | Evaluation logic |
title_auth | Evaluation logic |
title_exact_search | Evaluation logic |
title_full | Evaluation logic |
title_fullStr | Evaluation logic |
title_full_unstemmed | Evaluation logic |
title_short | Evaluation logic |
title_sort | evaluation logic |
topic | Computer software sigle Information theory sigle Mathematical sciences sigle Logic programming ML (Computer program language) |
topic_facet | Computer software Information theory Mathematical sciences Logic programming ML (Computer program language) |
volume_link | (DE-604)BV004055605 |
work_keys_str_mv | AT pittsandrewm evaluationlogic |