640 search results - page 3 / 128 » Logical types for untyped languages |
ACTA
1998
13 years 5 months ago
1998
We observe that every rst-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of manysorted formulas over that vocabulary. This re...
FLOPS
2008
Springer
13 years 6 months ago
2008
Springer
We propose undoable versions of the projection operations used when programs written in higher-order statically-typed languages interoperate with dynamically typed ones, localizing...
CADE
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
IFIP
2005
Springer
13 years 10 months ago
2005
Springer
This paper considers the effect of untyped attackers inside a distributed system where security is enforced by the type system. In previous work we introduced the Key-Based Decentr...
FOSSACS
2010
Springer
13 years 8 months ago
2010
Springer
A new framework for higher-order program verification has been recently proposed, in which higher-order functional programs are modelled as higher-order recursion schemes and then ...