Programming in Martin-Lo¨f's type theory: an introduction
Programming in Martin-Lo¨f's type theory: an introduction
A Discipline of Programming
Journal of Functional Programming
Modelling general recursion in type theory
Mathematical Structures in Computer Science
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Language Engineering and Rigorous Software Development
Dependently typed programming in Agda
AFP'08 Proceedings of the 6th international conference on Advanced functional programming
IDRIS ---: systems programming meets full dependent types
Proceedings of the 5th ACM workshop on Programming languages meets program verification
Epigram: practical programming with dependent types
AFP'04 Proceedings of the 5th international conference on Advanced Functional Programming
| Hi-index | 0.00 |
The problem of the Dutch national flag was formulated by Dijkstra (1976) as follows: There is a row of buckets numbered from 1 to n. It is given that: P1:each bucket contains one pebbleP2:each pebble is either red, white, or blue.A minicomputer is placed in front of this row of buckets and has to be programmed in such a way that it will rearrange (if necessary) the pebbles in the order of the Dutch national flag. The minicomputer in question should perform this rearrangement using two commands: â聙¢swapi j for 1â聣陇iâ聣陇n and 1â聣陇jâ聣陇n exchanges the pebbles stored in the buckets numbered i and j;â聙¢read (i) for 1â聣陇iâ聣陇n returns the colour of the pebble currently lying in bucket number i. Dijkstra originally named this operation buck.