34 search results - page 4 / 7 » icfp 2010 |
103
click to vote
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
A wide range of computer programs, including compilers and theorem provers, manipulate data structures that involve names and binding. However, the design of programming idioms wh...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
We show how the binary encoding and decoding of typed data and typed programs can be understood, programmed, and verified with the help of question-answer games. The encoding of a...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
ICFP
2010
ACM
14 years 10 months ago
2010
ACM
A student learning how to program learns best when the programming language and programming environment cater to her specific needs. These needs are different from the requirement...