uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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 finite axiomatization of inductive-recursive definitions
Uppsala University.
Uppsala University.
1999 (English)In: TYPED LAMBDA CALCULI AND APPLICATIONS, Vol. 1581, 129-146 p.Article in journal (Other scientific) Published
Abstract [en]

Induction-recursion is a scheme which formalizes the principles for introducing new sets in Martin-Lof's type theory. It states that we may inductively define a set while simultaneously defining a function from this set into an arbitrary type by structura

Place, publisher, year, edition, pages
SPRINGER-VERLAG BERLIN , 1999. Vol. 1581, 129-146 p.
Keyword [en]
LOF TYPE THEORIES
Identifiers
URN: urn:nbn:se:uu:diva-26941OAI: oai:DiVA.org:uu-26941DiVA: diva2:54835
Note
Addresses: Dybjer P, Chalmers Univ Technol, Dept Math & Comp Sci, Gothenburg, Sweden. Chalmers Univ Technol, Dept Math & Comp Sci, Gothenburg, Sweden. Univ Uppsala, Dept Math, S-75105 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 379 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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