Autor:	Paul Jacquet
Rok vydání:	2005
Předmět:	Class (set theory) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Theoretical computer science Computer science Computation Program synthesis
Zdroj:	9th International Conference on Automated Deduction ISBN: 354019343X CADE
DOI:	10.1007/bfb0012856
Popis:	In this paper we explore the possibility of specifying a restricted form of conditional equations within, what we call, a dependent subtypes discipline. Applying recent results on order sorted computation to the lattice structure of dependent subtypes we show how the Knuth-Bendix completion procedure can be used to synthesize a restricted class of programs, a subject which brought about this work.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::20d16264767074822bbb0537802ef6ea https://doi.org/10.1007/bfb0012856 Zobrazit plný text záznamu