Sciweavers

10 search results - page 1 / 2
» Type Error Slicing in Implicitly Typed Higher-Order Language...
Sort
View
ESOP
2003
Springer
13 years 10 months ago
Type Error Slicing in Implicitly Typed Higher-Order Languages
Previous methods have generally identified the location of a type error as a particular program point or the program subtree rooted at that point. We present a new approach that ...
Christian Haack, J. B. Wells
ESOP
2009
Springer
14 years 2 days ago
Exploring the Design Space of Higher-Order Casts
This paper explores the surprisingly rich design space for the simply typed lambda calculus with casts and a dynamic type. Such a calculus is the target intermediate language of th...
Jeremy G. Siek, Ronald Garcia, Walid Taha
ICFP
1997
ACM
13 years 9 months ago
Foundations for the Implementation of Higher-Order Subtyping
We show how to implement a calculus with higher-order subtyping and subkinding by replacing uses of implicit subsumption with explicit coercions. To ensure this can be done, a pol...
Karl Crary
APLAS
2006
ACM
13 years 11 months ago
Automatic Testing of Higher Order Functions
This paper tackles a problem often overlooked in functional programming community: that of testing. Fully automatic test tools like Quickcheck and G∀ST can test first order func...
Pieter W. M. Koopman, Rinus Plasmeijer
KBSE
2009
IEEE
14 years 5 hour ago
Static Typing for Ruby on Rails
—Ruby on Rails (or just “Rails”) is a popular web application framework built on top of Ruby, an objectoriented scripting language. While Ruby’s powerful features such as d...
Jong-hoon (David) An, Avik Chaudhuri, Jeffrey S. F...