CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Random generators for dependent types

Peter Dybjer (Institutionen för datavetenskap, Programmeringslogik) ; Haiyan Qiao ; Makoto Takeyama
Proceedings of the First International Colloquium on Theoretical Aspects of Computing, Guiyang, China, September 2004 (0302-9743). p. 341 -355 . (2004)
[Konferensbidrag, refereegranskat]

We show how to write surjective random generators for several different classes of inductively defined types in dependent type theory. We discuss both non-indexed (simple) types and indexed families of types. In particular we show how to use the relationship between indexed inductive definitions and logic programs: the indexed inductive definition of a type family corresponds to a logic program, and generating an object of a type in the family corresponds to solving a query for the logic program. As an example, we show how to write a surjective random generator for theorems in propositional logic by randomising the Prolog search algorithm.

Denna post skapades 2006-08-25. Senast ändrad 2013-08-12.
CPL Pubid: 2258


Läs direkt!

Länk till annan sajt (kan kräva inloggning)

Institutioner (Chalmers)

Institutionen för datavetenskap, Programmeringslogik (2002-2004)


Information Technology

Chalmers infrastruktur