TU Darmstadt / ULB / TUbiblio

On intuitionistic proof transformations, their complexity, and application to constructive program synthesis

Egly, Uwe ; Schmitt, S. (1999):
On intuitionistic proof transformations, their complexity, and application to constructive program synthesis.
39, In: Fundamenta Informaticae, (1-2), pp. 59-83. IOS Press, ISSN 01692968,
DOI: 10.3233/FI-1999-391204,
[Article]

Item Type: Article
Erschienen: 1999
Creators: Egly, Uwe ; Schmitt, S.
Title: On intuitionistic proof transformations, their complexity, and application to constructive program synthesis
Language: English
Journal or Publication Title: Fundamenta Informaticae
Volume: 39
Number: 1-2
Publisher: IOS Press
Divisions: 20 Department of Computer Science
Date Deposited: 19 Nov 2008 16:22
DOI: 10.3233/FI-1999-391204
License: [undefiniert]
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details