678 search results - page 61 / 136 » Dependent Types for Program Understanding |
HASKELL
2006
ACM
14 years 3 months ago
2006
ACM
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
LICS
1989
IEEE
14 years 15 days ago
1989
IEEE
We describe Elf, a metalanguage for proof manipulation environments that are independent of any particular logical system. Elf is intended for meta-programs such as theorem prover...
TLDI
2010
ACM
14 years 5 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...
CACM
1999
13 years 8 months ago
1999
ion suffices ("decide which type you want and provide a full set of operations for each type"). If the application domain is, say, the administration of a university, the...
ISW
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Program obfuscation is a semantic-preserving transformation aimed at bringing a program into such a form, which impedes the understanding of its algorithm and data struct...