A semantic approach to proving Prolog transformations using cut:
Abstract: "An algebraic AND/OR process semantics of sequential Prolog with cut is defined using Miller's Calculus of Communicating Systems (CCS). This semantics axiomatises the operational semantics at the language level, rather than at a meta-program level. The semantics is hierarchial. A...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Edinburgh
1990
|
Schriftenreihe: | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper
488 |
Schlagworte: | |
Zusammenfassung: | Abstract: "An algebraic AND/OR process semantics of sequential Prolog with cut is defined using Miller's Calculus of Communicating Systems (CCS). This semantics axiomatises the operational semantics at the language level, rather than at a meta-program level. The semantics is hierarchial. A low-level semantics defines the operational semantics of AND/OR processes using the CCS formulae. A higher-level semantics, whose definition is justified using the low-level semantics, defines operational behavior at an operator or computation tree level. Some program transformations which make use of cut are verified using this semantics." |
Beschreibung: | 27 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010452414 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t | ||
008 | 951027s1990 |||| 00||| engod | ||
035 | |a (OCoLC)23725200 | ||
035 | |a (DE-599)BVBBV010452414 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-91G | ||
100 | 1 | |a Ross, Brian J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a A semantic approach to proving Prolog transformations using cut |c Brian J. Ross ; Paul F. Wilk |
264 | 1 | |a Edinburgh |c 1990 | |
300 | |a 27 S. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |v 488 | |
520 | 3 | |a Abstract: "An algebraic AND/OR process semantics of sequential Prolog with cut is defined using Miller's Calculus of Communicating Systems (CCS). This semantics axiomatises the operational semantics at the language level, rather than at a meta-program level. The semantics is hierarchial. A low-level semantics defines the operational semantics of AND/OR processes using the CCS formulae. A higher-level semantics, whose definition is justified using the low-level semantics, defines operational behavior at an operator or computation tree level. Some program transformations which make use of cut are verified using this semantics." | |
650 | 7 | |a Computer software |2 sigle | |
650 | 7 | |a Mathematics |2 sigle | |
650 | 4 | |a Mathematik | |
650 | 4 | |a Prolog | |
650 | 4 | |a Semantics | |
700 | 1 | |a Wilk, Paul F. |e Verfasser |4 aut | |
810 | 2 | |a Department of Artificial Intelligence: DAI research paper |t University <Edinburgh> |v 488 |w (DE-604)BV010450646 |9 488 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006965313 |
Datensatz im Suchindex
_version_ | 1804124885586280448 |
---|---|
any_adam_object | |
author | Ross, Brian J. Wilk, Paul F. |
author_facet | Ross, Brian J. Wilk, Paul F. |
author_role | aut aut |
author_sort | Ross, Brian J. |
author_variant | b j r bj bjr p f w pf pfw |
building | Verbundindex |
bvnumber | BV010452414 |
ctrlnum | (OCoLC)23725200 (DE-599)BVBBV010452414 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01755nam a2200349 cb4500</leader><controlfield tag="001">BV010452414</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951027s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)23725200</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010452414</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ross, Brian J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A semantic approach to proving Prolog transformations using cut</subfield><subfield code="c">Brian J. Ross ; Paul F. Wilk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edinburgh</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">27 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">University <Edinburgh> / Department of Artificial Intelligence: DAI research paper</subfield><subfield code="v">488</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "An algebraic AND/OR process semantics of sequential Prolog with cut is defined using Miller's Calculus of Communicating Systems (CCS). This semantics axiomatises the operational semantics at the language level, rather than at a meta-program level. The semantics is hierarchial. A low-level semantics defines the operational semantics of AND/OR processes using the CCS formulae. A higher-level semantics, whose definition is justified using the low-level semantics, defines operational behavior at an operator or computation tree level. Some program transformations which make use of cut are verified using this semantics."</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">Mathematics</subfield><subfield code="2">sigle</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Prolog</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wilk, Paul F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Artificial Intelligence: DAI research paper</subfield><subfield code="t">University <Edinburgh></subfield><subfield code="v">488</subfield><subfield code="w">(DE-604)BV010450646</subfield><subfield code="9">488</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006965313</subfield></datafield></record></collection> |
id | DE-604.BV010452414 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:52:46Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006965313 |
oclc_num | 23725200 |
open_access_boolean | |
owner | DE-91G DE-BY-TUM |
owner_facet | DE-91G DE-BY-TUM |
physical | 27 S. |
publishDate | 1990 |
publishDateSearch | 1990 |
publishDateSort | 1990 |
record_format | marc |
series2 | University <Edinburgh> / Department of Artificial Intelligence: DAI research paper |
spelling | Ross, Brian J. Verfasser aut A semantic approach to proving Prolog transformations using cut Brian J. Ross ; Paul F. Wilk Edinburgh 1990 27 S. txt rdacontent n rdamedia nc rdacarrier University <Edinburgh> / Department of Artificial Intelligence: DAI research paper 488 Abstract: "An algebraic AND/OR process semantics of sequential Prolog with cut is defined using Miller's Calculus of Communicating Systems (CCS). This semantics axiomatises the operational semantics at the language level, rather than at a meta-program level. The semantics is hierarchial. A low-level semantics defines the operational semantics of AND/OR processes using the CCS formulae. A higher-level semantics, whose definition is justified using the low-level semantics, defines operational behavior at an operator or computation tree level. Some program transformations which make use of cut are verified using this semantics." Computer software sigle Mathematics sigle Mathematik Prolog Semantics Wilk, Paul F. Verfasser aut Department of Artificial Intelligence: DAI research paper University <Edinburgh> 488 (DE-604)BV010450646 488 |
spellingShingle | Ross, Brian J. Wilk, Paul F. A semantic approach to proving Prolog transformations using cut Computer software sigle Mathematics sigle Mathematik Prolog Semantics |
title | A semantic approach to proving Prolog transformations using cut |
title_auth | A semantic approach to proving Prolog transformations using cut |
title_exact_search | A semantic approach to proving Prolog transformations using cut |
title_full | A semantic approach to proving Prolog transformations using cut Brian J. Ross ; Paul F. Wilk |
title_fullStr | A semantic approach to proving Prolog transformations using cut Brian J. Ross ; Paul F. Wilk |
title_full_unstemmed | A semantic approach to proving Prolog transformations using cut Brian J. Ross ; Paul F. Wilk |
title_short | A semantic approach to proving Prolog transformations using cut |
title_sort | a semantic approach to proving prolog transformations using cut |
topic | Computer software sigle Mathematics sigle Mathematik Prolog Semantics |
topic_facet | Computer software Mathematics Mathematik Prolog Semantics |
volume_link | (DE-604)BV010450646 |
work_keys_str_mv | AT rossbrianj asemanticapproachtoprovingprologtransformationsusingcut AT wilkpaulf asemanticapproachtoprovingprologtransformationsusingcut |