54 search results - page 4 / 11 » A Tutorial Implementation of a Dependently Typed Lambda Calc... |
164
Voted
SEFM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper presents an implicitly-typed functional, aspect-oriented programming language: λ AOP. The main contribution of the paper is a semantics for λ AOP advice weaving. The ...
181
Voted
TOCL
2012
13 years 6 months ago
2012
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...
139
Voted
ICFP
2010
ACM
15 years 4 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. ...
136
Voted
PADL
2004
Springer
15 years 9 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
158
Voted
BIRTHDAY
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We introduce an ambient-based calculus that combines ambient mobility with process mobility, uses group names to collect ambients with homologous features, and exploits c...