Sciweavers

111 search results - page 15 / 23
» Constructing Polymorphic Programs with Quotient Types
Sort
View
ICECCS
2002
IEEE
85views Hardware» more  ICECCS 2002»
14 years 25 days ago
Syntactic Fault Patterns in OO Programs
Although program faults are widely studied, there are many aspects of faults that we still do not understand, particularly about OO software. In addition to the simple fact that o...
Roger T. Alexander, Jeff Offutt, James M. Bieman
SCP
2011
255views Communications» more  SCP 2011»
13 years 2 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
ESOP
2006
Springer
13 years 11 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
SAC
2004
ACM
14 years 1 months ago
Interface utilization in the Java Development Kit
Interfaces as defined in the JAVA programming language can enhance both decoupling and comprehensibility of large code bases. Several researchers have pointed out this key role of...
Jens Gößner, Philip Mayer, Friedrich St...
ICFP
2008
ACM
14 years 7 months ago
AURA: a programming language for authorization and audit
This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic co...
Limin Jia, Jeffrey A. Vaughan, Karl Mazurak, Jianz...