Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Logical aspects of the Andorra Kernal Language
Number of Authors: 1
1991 (English)Report (Refereed)
Abstract [en]

The Computation model for Kernal Andorra is Presented, and some logical aspects treated. In particular a soundness theorem relative to a modified completion involving a logical interpretation of cut procedures is proved, together with a completeness theorem for wait-clauses.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1991, 1. , 32 p.
Series
SICS Research Report, ISSN 0283-3638 ; R91:12
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:ri:diva-22168OAI: oai:DiVA.org:ri-22168DiVA: diva2:1041711
Available from: 2016-10-31 Created: 2016-10-31Bibliographically approved

Open Access in DiVA

fulltext(3026 kB)13 downloads
File information
File name FULLTEXT01.pdfFile size 3026 kBChecksum SHA-512
2f4715277ad546685bcdaa7a7a495f7282ab7f9d1740e63356000d2c2bc14d6b81ef70e03c46b37853e0bd6ef6b1f6787d6bf15fba720ee4d75bcb23b97d3151
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 13 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf