Repository | Book | Chapter
Constructive theories with abstract data types for program synthesis
pp. 293-302
Abstract
The research explained in this paper originates from program synthesis in the frame of intuitionistic logic [6] and has been furtherly developed as a study involving, on the one hand, constructive proofs as programs [12], on the other hand the possibility of providing axiomatizations of mathematical structures (abstract data types) compatible with constructive logical principles [3].
Publication details
Published in:
Skordev Dimiter G (1987) Mathematical logic and its applications. Dordrecht, Springer.
Pages: 293-302
DOI: 10.1007/978-1-4613-0897-3_21
Full citation:
Miglioli Pierangelo, Moscato Ugo, Ornaghi Mario (1987) „Constructive theories with abstract data types for program synthesis“, In: D.G. Skordev (ed.), Mathematical logic and its applications, Dordrecht, Springer, 293–302.