39 search results - page 8 / 8 » Using Modes to Ensure Subject Reduction for Typed Logic Prog... |
TLDI
2010
ACM
14 years 1 months ago
2010
ACM
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
POPL
2007
ACM
14 years 5 months ago
2007
ACM
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
SIGSOFT
2000
ACM
13 years 9 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
ICSE
2005
IEEE-ACM
14 years 4 months ago
2005
IEEE-ACM
Existing spreadsheet systems allow users to change cells arbitrarily, which is a major source of spreadsheet errors. We propose a system that prevents errors in spreadsheets by re...