Co-induction and co-recursion in higher-order logic:
Abstract: "A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanised using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express co-inductive data types, such as lazy lists. Well-founded...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge
1993
|
Schriftenreihe: | Computer Laboratory <Cambridge>: Technical report
304 |
Schlagworte: | |
Zusammenfassung: | Abstract: "A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanised using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express co-inductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; co-recursion expresses functions that yield elements of co-inductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also The theory is demonstrated using lists and lazy lists as examples. The emphasis is on using co-recursion to define lazy list functions, and on using co-induction to reason about them. |
Beschreibung: | 35 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV010412729 | ||
003 | DE-604 | ||
005 | 19960925 | ||
007 | t | ||
008 | 951009s1993 |||| 00||| engod | ||
035 | |a (OCoLC)31358851 | ||
035 | |a (DE-599)BVBBV010412729 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
084 | |a DAT 540f |2 stub | ||
100 | 1 | |a Paulson, Lawrence C. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Co-induction and co-recursion in higher-order logic |
264 | 1 | |a Cambridge |c 1993 | |
300 | |a 35 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 304 | |
520 | 3 | |a Abstract: "A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanised using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express co-inductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; co-recursion expresses functions that yield elements of co-inductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also | |
520 | 3 | |a The theory is demonstrated using lists and lazy lists as examples. The emphasis is on using co-recursion to define lazy list functions, and on using co-induction to reason about them. | |
650 | 7 | |a Computer software |2 sigle | |
650 | 4 | |a Automatic theorem proving | |
650 | 4 | |a Isabelle (Computer program) | |
830 | 0 | |a Computer Laboratory <Cambridge>: Technical report |v 304 |w (DE-604)BV004055605 |9 304 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-006934527 |
Datensatz im Suchindex
_version_ | 1804124841429696512 |
---|---|
any_adam_object | |
author | Paulson, Lawrence C. |
author_facet | Paulson, Lawrence C. |
author_role | aut |
author_sort | Paulson, Lawrence C. |
author_variant | l c p lc lcp |
building | Verbundindex |
bvnumber | BV010412729 |
classification_tum | DAT 540f |
ctrlnum | (OCoLC)31358851 (DE-599)BVBBV010412729 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01894nam a2200325 cb4500</leader><controlfield tag="001">BV010412729</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960925 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">951009s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31358851</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010412729</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="084" ind1=" " ind2=" "><subfield code="a">DAT 540f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Paulson, Lawrence C.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Co-induction and co-recursion in higher-order logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">35 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">304</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanised using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express co-inductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; co-recursion expresses functions that yield elements of co-inductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">The theory is demonstrated using lists and lazy lists as examples. The emphasis is on using co-recursion to define lazy list functions, and on using co-induction to reason about them.</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="4"><subfield code="a">Automatic theorem proving</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Isabelle (Computer program)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Laboratory <Cambridge>: Technical report</subfield><subfield code="v">304</subfield><subfield code="w">(DE-604)BV004055605</subfield><subfield code="9">304</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006934527</subfield></datafield></record></collection> |
id | DE-604.BV010412729 |
illustrated | Not Illustrated |
indexdate | 2024-07-09T17:52:04Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006934527 |
oclc_num | 31358851 |
open_access_boolean | |
physical | 35 S. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
record_format | marc |
series | Computer Laboratory <Cambridge>: Technical report |
series2 | Computer Laboratory <Cambridge>: Technical report |
spelling | Paulson, Lawrence C. Verfasser aut Co-induction and co-recursion in higher-order logic Cambridge 1993 35 S. txt rdacontent n rdamedia nc rdacarrier Computer Laboratory <Cambridge>: Technical report 304 Abstract: "A theory of recursive and corecursive definitions has been developed in higher-order logic (HOL) and mechanised using Isabelle. Least fixedpoints express inductive data types such as strict lists; greatest fixedpoints express co-inductive data types, such as lazy lists. Well-founded recursion expresses recursive functions over inductive data types; co-recursion expresses functions that yield elements of co-inductive data types. The theory rests on a traditional formalization of infinite trees. The theory is intended for use in specification and verification. It supports reasoning about a wide range of computable functions, but it does not formalize their operational semantics and can express noncomputable functions also The theory is demonstrated using lists and lazy lists as examples. The emphasis is on using co-recursion to define lazy list functions, and on using co-induction to reason about them. Computer software sigle Automatic theorem proving Isabelle (Computer program) Computer Laboratory <Cambridge>: Technical report 304 (DE-604)BV004055605 304 |
spellingShingle | Paulson, Lawrence C. Co-induction and co-recursion in higher-order logic Computer Laboratory <Cambridge>: Technical report Computer software sigle Automatic theorem proving Isabelle (Computer program) |
title | Co-induction and co-recursion in higher-order logic |
title_auth | Co-induction and co-recursion in higher-order logic |
title_exact_search | Co-induction and co-recursion in higher-order logic |
title_full | Co-induction and co-recursion in higher-order logic |
title_fullStr | Co-induction and co-recursion in higher-order logic |
title_full_unstemmed | Co-induction and co-recursion in higher-order logic |
title_short | Co-induction and co-recursion in higher-order logic |
title_sort | co induction and co recursion in higher order logic |
topic | Computer software sigle Automatic theorem proving Isabelle (Computer program) |
topic_facet | Computer software Automatic theorem proving Isabelle (Computer program) |
volume_link | (DE-604)BV004055605 |
work_keys_str_mv | AT paulsonlawrencec coinductionandcorecursioninhigherorderlogic |