Programs as types:
Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop h...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Ithaca, New York
1980
|
| Series: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
423 |
| Subjects: | |
| Summary: | Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop higher order logic and algorithmic (or programming or dynamic) logic in the theory. The theory described here is an evolution from de Bruijn's AUTOMATH and Martin-Lof's Intuitionistic Theory of Types. |
| Physical Description: | 49 Sp. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010009996 | ||
| 003 | DE-604 | ||
| 005 | 20200630 | ||
| 007 | t | ||
| 008 | 950127s1980 |||| 00||| engod | ||
| 035 | |a (OCoLC)63576423 | ||
| 035 | |a (DE-599)BVBBV010009996 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Constable, Robert Lee |d 1952- |e Verfasser |0 (DE-588)1089583133 |4 aut | |
| 245 | 1 | 0 | |a Programs as types |
| 264 | 1 | |a Ithaca, New York |c 1980 | |
| 300 | |a 49 Sp. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 423 | |
| 520 | 3 | |a Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop higher order logic and algorithmic (or programming or dynamic) logic in the theory. The theory described here is an evolution from de Bruijn's AUTOMATH and Martin-Lof's Intuitionistic Theory of Types. | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a PL/CV (Computer program language) | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 423 |w (DE-604)BV006185504 |9 423 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006636959 | ||
Record in the Search Index
| _version_ | 1804124389253316608 |
|---|---|
| any_adam_object | |
| author | Constable, Robert Lee 1952- |
| author_GND | (DE-588)1089583133 |
| author_facet | Constable, Robert Lee 1952- |
| author_role | aut |
| author_sort | Constable, Robert Lee 1952- |
| author_variant | r l c rl rlc |
| building | Verbundindex |
| bvnumber | BV010009996 |
| ctrlnum | (OCoLC)63576423 (DE-599)BVBBV010009996 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01449nam a2200289 cb4500</leader><controlfield tag="001">BV010009996</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20200630 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950127s1980 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)63576423</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010009996</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="100" ind1="1" ind2=" "><subfield code="a">Constable, Robert Lee</subfield><subfield code="d">1952-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1089583133</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Programs as types</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, New York</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">49 Sp.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">423</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop higher order logic and algorithmic (or programming or dynamic) logic in the theory. The theory described here is an evolution from de Bruijn's AUTOMATH and Martin-Lof's Intuitionistic Theory of Types.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">PL/CV (Computer program language)</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">423</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">423</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006636959</subfield></datafield></record></collection> |
| id | DE-604.BV010009996 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:44:53Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006636959 |
| oclc_num | 63576423 |
| open_access_boolean | |
| physical | 49 Sp. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Constable, Robert Lee 1952- Verfasser (DE-588)1089583133 aut Programs as types Ithaca, New York 1980 49 Sp. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 423 Programs are interpreted as types in a constructive type theory. Rules for a logic of programs can then be derived from rules for types. This approach is the basis of nonelementary reasoning in the PL/CV3 (program) verification system. This paper summarizes the type theory and shows how to develop higher order logic and algorithmic (or programming or dynamic) logic in the theory. The theory described here is an evolution from de Bruijn's AUTOMATH and Martin-Lof's Intuitionistic Theory of Types. Computer programming PL/CV (Computer program language) Department of Computer Science: Technical report Cornell University <Ithaca, NY> 423 (DE-604)BV006185504 423 |
| spellingShingle | Constable, Robert Lee 1952- Programs as types Computer programming PL/CV (Computer program language) |
| title | Programs as types |
| title_auth | Programs as types |
| title_exact_search | Programs as types |
| title_full | Programs as types |
| title_fullStr | Programs as types |
| title_full_unstemmed | Programs as types |
| title_short | Programs as types |
| title_sort | programs as types |
| topic | Computer programming PL/CV (Computer program language) |
| topic_facet | Computer programming PL/CV (Computer program language) |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT constablerobertlee programsastypes |