Sciweavers

12 search results - page 2 / 3
» A lambda calculus of objects and method specialization
Sort
View
ESOP
2001
Springer
13 years 9 months ago
Proof-Directed De-compilation of Low-Level Code
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
Shin-ya Katsumata, Atsushi Ohori
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 7 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
ICFP
1997
ACM
13 years 9 months ago
Strongly Typed Flow-Directed Representation Transformations
d Abstract) Allyn Dimock Harvard University Robert Muller Boston College Franklyn Turbak Wellesley College J. B. Wells∗ Glasgow University Topic Areas: compilation, lambda calcul...
Allyn Dimock, Robert Muller, Franklyn A. Turbak, J...
DBSEC
1996
125views Database» more  DBSEC 1996»
13 years 6 months ago
A Framework for High Assurance Security of Distributed Objects
High assurance security is di cult to achieve in distributed computer systems and databases because of their complexity, non-determinism and inherent heterogeneity. The practical ...
John Hale, Jody Threet, Sujeet Shenoi
TLDI
2005
ACM
102views Formal Methods» more  TLDI 2005»
13 years 10 months ago
An open and shut typecase
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
Dimitrios Vytiniotis, Geoffrey Washburn, Stephanie...