7529 search results - page 285 / 1506 » The Modula-3 Type System |
181
click to vote
FOSSACS
2004
Springer
16 years 18 days ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
185
click to vote
ENTCS
2006
15 years 7 months ago
2006
We address the problem of applying resource-bounded functional programming languages in practice on object-oriented virtual machines which include calls to native methods coded in...
199
click to vote
LFCS
2009
Springer
16 years 1 months ago
2009
Springer
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
183
click to vote
PPDP
2005
Springer
16 years 21 days ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
214
click to vote
PPDP
2004
Springer
16 years 17 days ago
2004
Springer
We investigate some fundamental properties of the reduction relation in the untyped term calculus derived from Curien and Herbelin’s λµµ. The original λµµ has a system of ...