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.
In: Fundamenta Informaticae, 39 (1-2)
doi: 10.3233/FI-1999-391204
Article, Bibliographie

Item Type: Article
Erschienen: 1999
Creators: Egly, Uwe ; Schmitt, S.
Type of entry: Bibliographie
Title: On intuitionistic proof transformations, their complexity, and application to constructive program synthesis
Language: English
Date: 1 January 1999
Publisher: IOS Press
Journal or Publication Title: Fundamenta Informaticae
Volume of the journal: 39
Issue Number: 1-2
DOI: 10.3233/FI-1999-391204
Divisions: 20 Department of Computer Science
Date Deposited: 19 Nov 2008 16:22
Last Modified: 11 Dec 2020 11:41
PPN:
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