Action logic and pure induction:
Abstract: "In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalated along intervals instead of at states. Action logic is an equational theory ACT co...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1990
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1343 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication [formula] (had a then b) and postimplication [formula] (b if-ever a). Unlike REG, ACT is finitely based, makes a* reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, [formula]." |
| Beschreibung: | 22 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008978580 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24511309 | ||
| 035 | |a (DE-599)BVBBV008978580 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Pratt, Vaughan |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Action logic and pure induction |c Vaughan Pratt |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 22 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1343 | |
| 520 | 3 | |a Abstract: "In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication [formula] (had a then b) and postimplication [formula] (b if-ever a). Unlike REG, ACT is finitely based, makes a* reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, [formula]." | |
| 650 | 4 | |a Branching processes | |
| 650 | 4 | |a Logic circuits | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1343 |w (DE-604)BV008928280 |9 1343 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005929426 | ||
Datensatz im Suchindex
| _version_ | 1804123317315043328 |
|---|---|
| any_adam_object | |
| author | Pratt, Vaughan |
| author_facet | Pratt, Vaughan |
| author_role | aut |
| author_sort | Pratt, Vaughan |
| author_variant | v p vp |
| building | Verbundindex |
| bvnumber | BV008978580 |
| ctrlnum | (OCoLC)24511309 (DE-599)BVBBV008978580 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01552nam a2200301 cb4500</leader><controlfield tag="001">BV008978580</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24511309</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008978580</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-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Pratt, Vaughan</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Action logic and pure induction</subfield><subfield code="c">Vaughan Pratt</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">22 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">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1343</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication [formula] (had a then b) and postimplication [formula] (b if-ever a). Unlike REG, ACT is finitely based, makes a* reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, [formula]."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branching processes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic circuits</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1343</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1343</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005929426</subfield></datafield></record></collection> |
| id | DE-604.BV008978580 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005929426 |
| oclc_num | 24511309 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 22 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Pratt, Vaughan Verfasser aut Action logic and pure induction Vaughan Pratt Stanford, Calif. 1990 22 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1343 Abstract: "In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions whose truth is evalated along intervals instead of at states. Action logic is an equational theory ACT conservatively extending the equational theory REG of regular expressions with operations preimplication [formula] (had a then b) and postimplication [formula] (b if-ever a). Unlike REG, ACT is finitely based, makes a* reflexive transitive closure, and has an equivalent Hilbert system. The crucial axiom is that of pure induction, [formula]." Branching processes Logic circuits Computer Science Department: Report STAN-CS Stanford University 1343 (DE-604)BV008928280 1343 |
| spellingShingle | Pratt, Vaughan Action logic and pure induction Branching processes Logic circuits |
| title | Action logic and pure induction |
| title_auth | Action logic and pure induction |
| title_exact_search | Action logic and pure induction |
| title_full | Action logic and pure induction Vaughan Pratt |
| title_fullStr | Action logic and pure induction Vaughan Pratt |
| title_full_unstemmed | Action logic and pure induction Vaughan Pratt |
| title_short | Action logic and pure induction |
| title_sort | action logic and pure induction |
| topic | Branching processes Logic circuits |
| topic_facet | Branching processes Logic circuits |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT prattvaughan actionlogicandpureinduction |