3 citations · 8 across the 7 of their papers we have counts for
5 papers · 1 filter
Extracting total Amb programs from proofs
Ulrich Berger, Hideki Tsuiki
We present a logical system CFP (Concurrent Fixed Point Logic) supporting the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an…
Concurrent Gaussian elimination
Ulrich Berger, Monika Seisenberger, Dieter Spreen +1
Working in a semi-constructive logical system that supports the extraction of concurrent programs, we extract a program inverting non-singular real valued matrices from a construct…
Extracting total Amb programs from proofs
Ulrich Berger, Hideki Tsuiki
We present a logical system CFP (Concurrent Fixed Point Logic) from whose proofs one can extract nondeterministic and concurrent programs that are provably total and correct with r…
Intuitionistic Fixed Point Logic
Ulrich Berger, Hideki Tsuiki
We study the system IFP of intuitionistic fixed point logic, an extension of intuitionistic first-order logic by strictly positive inductive and coinductive definitions. We define…
Computable dyadic subbases and -representations of compact sets
Arno Pauly, Hideki Tsuiki
We explore representing the compact subsets of a given represented space by infinite sequences over Plotkin's . We show that computably compact computable metric spaces…