Eli Barzilay <e...@barzilay.org> writes: > On Apr 12, Matthias Felleisen wrote: >> > 5. Code for exhaustiveness (pattern matches enumerate all conditions). >> >> What you can see is that almost all of these apply to programming in >> PLT Scheme. Well, for 8, I will defer to Sam :-) > > #5 isn't in use outside of my class's language(s).
I was just going to ask how do you handle 5 in PLT Scheme. How can you force a match to actually make you exhaust all conditions? -- PMatos Member of the CSR plc group of companies. CSR plc registered in England and Wales, registered number 4187346, registered office Churchill House, Cambridge Business Park, Cowley Road, Cambridge, CB4 0WZ, United Kingdom _________________________________________________ For list-related administrative tasks: http://list.cs.brown.edu/mailman/listinfo/plt-dev
