360 search results - page 9 / 72 » Dependently Typed Programming in Agda |
ICFP
2010
ACM
13 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
ESOP
2004
Springer
14 years 28 days ago
2004
Springer
The Ambient calculus is a successful model of distributed, mobile computation, and has been the vehicle of new ideas for resource access control. Mobility types have been used to e...
PLDI
1998
ACM
13 years 11 months ago
1998
ACM
We present a type-based approach to eliminating array bound checking and list tag checking by conservatively extending Standard ML with a restricted form of dependent types. This ...
ECOOP
2003
Springer
14 years 23 days ago
2003
Springer
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
PLPV
2012
ACM
12 years 3 months ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...