Clinical research activities at academic medical centers are challenging to oversee. Without effective research administration, a continually evolving set of regulatory and institutional requirements can divert investigator and study team attention away from a focus on scientific gain, study conduct, and patient safety. However, even when the need for research administration is recognized, ther...

This paper details a research methodology that emerged during an inquiry into game design aimed at promoting conceptual learning in physics. The methodology, Research as DesignDesign as Research (RADDAR), is outlined and a case study example is provided as means to illustrate its application.

Dependent type systems allow for a rich set of program properties to be expressed and mechanically verified via type checking. However, despite their significant expressive power, dependent types have not yet advanced into mainstream programming languages. We believe the reason behind this omission is the large design space for dependently typed functional programming languages, and the consequ...

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. Proof irrelevance provides a mechanism for selectively hiding the identities of terms in type theories. In this paper, we show that refinement types can be interpreted as predicates using proof irrelevance in the context of the logical framework LF, establishi...

Static analysis techniques have been studied for many years in the functional programming community, most prominently the use of inferred types to eliminate run-time checks. In analogy, if we regard checking whether an instance is useful for a proof as run-time checks and we can find types that eliminate irrelevant instances, we may also be able to prevent proof searches from checking those irr...

The aim of this paper is to investigate, in the Curry-Howard isomorphism approach, a logical characterization for the intersection-type discipline First a novel formulation of the intersection type inference for combinatory logic is presented, such that it is equivalent to the original version of the system, while the intersection operator is no longer dealt with as a proof-theoretical connecti...