303 search results - page 23 / 61 » Theory Interpretation in Simple Type Theory |
MPC
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
MMMACNS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
HASKELL
2009
ACM
14 years 2 months ago
2009
ACM
It is common for compilers to derive the calling convention of a function from its type. Doing so is simple and modular but misses many optimisation opportunities, particularly in...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
JUCS
2010
13 years 2 months ago
2010
Abstract: We prove the correctness of a formalised realisability interpretation of extensions of first-order theories by inductive and coinductive definitions in an untyped -calcul...