bGSL: An imperative language for specification and refinement of backtracking programs

dc.contributor.author	Alexandra Sofia Mendes	en
dc.contributor.other	7344	en
dc.date.accessioned	2023-11-15T21:45:52Z
dc.date.available	2023-11-15T21:45:52Z
dc.date.issued	2023	en
dc.description.abstract	We present an imperative refinement language for the development of backtracking programs and discuss its semantic foundations. For expressivity, our language includes prospective values and preference - the latter being a variant of Nelson's biased choice that backtracks from infeasibility of a continuation. Our key contribution is to examine feasibility-preserving refinement as a basis for developing backtracking programs, and several key refinement laws that enable compositional refinement in the presence of non -monotonic program combinators.	en
dc.identifier	P-00X-8V3	en
dc.identifier.uri	https://repositorio.inesctec.pt/handle/123456789/14535
dc.language	eng	en
dc.rights	info:eu-repo/semantics/openAccess	en
dc.title	bGSL: An imperative language for specification and refinement of backtracking programs	en
dc.type		en
dc.type	Publication	en

Now showing 1 - 1 of 1