• Publications
  • Influence
A judgmental reconstruction of modal logic
TLDR
This work reconsiders the foundations of modal logic, following Martin-Löf's methodology of distinguishing judgments from propositions, and gives a new presentation of lax logic, finding that the lax modality is already expressible using possibility and necessity. Expand
A modal analysis of staged computation
We show that a type system based on the intuitionistic modal logic S4 provides an expressive framework for specifying and analyzing computation stages in the context of typed λ-calculi andExpand
A modal analysis of staged computation
TLDR
The main technical result is a conservative embedding of Nielson & Nielson's two-level functional language in the language Mini-ML, thus proving that binding-time correctness is equivalent to modal correctness on this fragment. Expand
A temporal-logic approach to binding-time analysis
  • Rowan Davies
  • Mathematics, Computer Science
  • Proceedings 11th Annual IEEE Symposium on Logic…
  • 27 July 1996
TLDR
It is proved that normalization in /spl lambda//sup O/ can be done in an order corresponding to the times in the logic, which explains why /spl Lambda//Sup O/ is relevant to partial evaluation. Expand
Intersection types and computational effects
TLDR
A solution similar to the value restriction for polymorphism adopted in the revised definition of Standard ML is proposed, which is not tied to let-expressions and requires an additional weakening of the usual subtyping rules. Expand
Efficient Detection and Recognition of 3D Ears
TLDR
A very fast 2D AdaBoost detector is combined with fast 3D local feature matching and fine matching via an Iterative Closest Point (ICP) algorithm to obtain a complete, robust and fully automatic system with a good balance between speed and accuracy. Expand
Practical refinement-type checking
TLDR
This dissertation describes an approach called refinement-type checking that allows many common program properties to be captured and checked, and demonstrates the practicality of this approach by showing that it can be used to design a refinement- type checker for a widely-used language with a strong type system: Standard ML. Expand
A Temporal Logic Approach to Binding-Time Analysis
TLDR
It is demonstrated that there is a fundamental relationship between temporal logic and languages that involve multiple stages, such as those used to analyze binding times in the context of partial evaluation, and λ° is equivalent to the core of a previously studied multilevel binding-time analysis. Expand
Service Combinators for Web Computing
TLDR
A concurrent model that directly incorporates the notions of failure and rate of communication is introduced, and programming constructs based on this model are described. Expand
Multibiometric human recognition using 3D ear and face features
TLDR
This paper is the first to present feature level fusion of 3D features extracted from ear and frontal face data and scores from L3DF based matching are also fused with iterative closest point algorithm based matching using a weighted sum rule. Expand
...
1
2
3
...