Compilers for polymorphic languages can use run-time type inspection to support advanced imple-mentation techniques such as tagless garbage collection, polymorphic marshalling, and flattened data structures. Intensional type analysis is a type-theoretic framework for expressing and certify-ing

syntax as an MetaMLdatatype declare x = 10 in -- x := x - 1; print x Sample program in concrete Syntax val S1 = Declare("x",Constant 10, Seq(Assign("x",Minus(Variable "x", Constant 1)), Print(Variable "y"))); Datatype encoding of sample program. !Do %mswo -- %push 10 ; a !- %read 1 ; b !- Return %mswo a %- 1 ; c !- %write 1 b ; d !- %read 1 ; e !- %output d ; Return %mswo () ; %pop ? Residual result of staging example program. (* interpret2 : Com -? index -? !unit M? *) fun interpret2 stmt index = case stmt of Assign(name,e) =? let val loc = position name index in !Do mswo -- n !- ~(eval2 e index) ; write ~(lift loc) n ? end --- Seq(s1,s2) =? !Do mswo -- x !- ~(interpret2 s1 index) ; y !- ~(interpret2 s2 index) ; Return mswo () ? --- Cond(e,s1,s2) =? !Do mswo -- x !- ~(eval2 e index) ; if x=1 then ~(interpret2 s1 index) else ~(interpret2 s2 index)? --- While(e,b) =? !let fun loop () = Do mswo -- v !- ~(eval2 e index) ; if v=0 then Return mswo...

Type Analysis [1] and Certified Binaries [2] are two such type-theoretic frameworks. Previous work in these areas, however, has not adequately supported recursive types. In this paper we present a new formulation of recursive types which subsumes the traditional one. We show that intensional analysis

This paper presents the definition of a language with reflection primitives. The language is a homogeneous multi-stage language that provides the capacity of code analysis by the inclusion of a pat-tern matching mechanism that permits inspection of the structure of quoted expressions

The views and conclusions contained in this document are those of the authors and should not be interpreted as

Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and flattened data structures. Intensional type analysis is a type-theoretic framework for expressing and certifying

, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensional paradoxes are recalcitrant and challenge logical analysis. Indeed, when we take these paradoxes seriously, we may need to rethink the commonly accepted methods for dealing with the logical paradoxes.

Intensional type analysis provides the ability to analyze abstracted types at run time. In this paper, we extend that ability to higherorder and kind-polymorphic type constructors. The resulting language is elegant and expressive. We show through examples how it extends the repertoire

Abstract. Through ethnographic research, we document the rise of personal social networks in the workplace, which we call intensional networks. Paradoxically, we find that the most fundamental unit of analysis for computer-supported cooperative work is not at the group level for many tasks

Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and flattened data structures. Intensional type analysis is a type-theoretic framework for expressing and certifying