Titlebook: Mathematics of Program Construction; 6th International Co Eerke A. Boiten,Bernhard M?ller Conference proceedings 2002 Springer-Verlag Berli

Perennial長期的

prick-test

Mathematics of Program Construction978-3-540-45442-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

AVERT

neurologist

From Kleene Algebra to Refinement AlgebraKleene Algebra with Tests (KAT) has proved to be useful for reasoning about programs in a partial correctness framework. We describe Demonic Refinement Algebra (DRA), a variation of KAT for total correctness and illustrate its modeling and reasoning power with a number of applications and examples.

Medley

Eerke A. Boiten,Bernhard M?llerIncludes supplementary material:

散開

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626962.jpg

CRUMB

https://doi.org/10.1007/3-540-45442-XD programming language; Haskell; Variable; algorithms; computer science; language; program transformation;

conception

adjacent

Type-Indexed Data Typestype by induction on the structure of the type of search keys. This paper shows how to define type-indexed data types, discusses several examples of type-indexed data types, and shows how to specialize type-indexed data types. The approach has been implemented in ., a generic programming extension of the functional language Haskell.

打擊