Proving termination properties of PROLOG programs - Info and Reading Options
a semantic approach
By Marianne Baudinet
"Proving termination properties of PROLOG programs" was published by Dept. of Computer Science, Stanford University in 1988 - Stanford, Calif, it has 13 pages and the language of the book is English.
“Proving termination properties of PROLOG programs” Metadata:
- Title: ➤ Proving termination properties of PROLOG programs
- Author: Marianne Baudinet
- Language: English
- Number of Pages: 13
- Publisher: ➤ Dept. of Computer Science, Stanford University
- Publish Date: 1988
- Publish Location: Stanford, Calif
“Proving termination properties of PROLOG programs” Subjects and Themes:
- Subjects: ➤ Artificial intelligence - Computer programs - Correctness - Programming languages (Electronic computers) - Prolog (Computer program language) - Semantics - Termination
Edition Specifications:
- Pagination: 13 p. ;
Edition Identifiers:
- The Open Library ID: OL2233632M - OL4817346W
- Online Computer Library Center (OCLC) ID: 19271954
- Library of Congress Control Number (LCCN): 89102094
AI-generated Review of “Proving termination properties of PROLOG programs”:
Read “Proving termination properties of PROLOG programs”:
Read “Proving termination properties of PROLOG programs” by choosing from the options below.
Search for “Proving termination properties of PROLOG programs” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “Proving termination properties of PROLOG programs” in Libraries Near You:
Read or borrow “Proving termination properties of PROLOG programs” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “Proving termination properties of PROLOG programs” at a library near you.
Buy “Proving termination properties of PROLOG programs” online:
Shop for “Proving termination properties of PROLOG programs” on popular online marketplaces.
- Ebay: New and used books.