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
A finitary version of the calculus of partial inductive definitions
RISE, Swedish ICT, SICS.
1992 (English)Report (Other academic)
Abstract [en]

The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary representation, and prove its soundness. The finitary representation is given in a form with and without variables. Without variables, derivations are unchanging entities. With variables, derivations can contain logical variables that can become bound by a binding environment that is extended as the derivation is constructed. The variant with variables is essentially a generalization of the pure GCLA programming language.

Place, publisher, year, edition, pages
Swedish Institute of Computer Science , 1992, 1. , p. 46
Series
SICS Research Report, ISSN 0283-3638 ; R92:08
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-21365OAI: oai:DiVA.org:ri-21365DiVA, id: diva2:1041401
Available from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-01-14Bibliographically approved

Open Access in DiVA

fulltext(5230 kB)11 downloads
File information
File name FULLTEXT01.pdfFile size 5230 kBChecksum SHA-512
994bb55e118dde649e7941098bb7ffe62d5a84f7ef929979cdeef76b1c1c071d793cddfaecd3af8d93816572602659fc3397e9c6aa4030e55cb58c8afa78a760
Type fulltextMimetype application/pdf

Other links

fulltext
By organisation
SICS
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 11 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

urn-nbn

Altmetric score

urn-nbn
Total: 4 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
v. 2.35.2