Sciweavers

18429 search results - page 124 / 3686
» Typing dynamic typing
Sort
View
ENTCS
2007
109views more  ENTCS 2007»
15 years 4 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
NGC
2008
Springer
149views Communications» more  NGC 2008»
15 years 4 months ago
A New Type System for JVM Lock Primitives
A bytecode verifier for the Java virtual machine language (JVML) statically checks that bytecode does not cause any fatal error. However, the present verifier does not check correc...
Futoshi Iwama, Naoki Kobayashi
152
Voted
ACTA
2005
104views more  ACTA 2005»
15 years 4 months ago
Subtyping for session types in the pi calculus
Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols,...
Simon J. Gay, Malcolm Hole
110
Voted
JAT
2007
56views more  JAT 2007»
15 years 4 months ago
Multiple orthogonal polynomials of mixed type and non-intersecting Brownian motions
We present a generalization of multiple orthogonal polynomials of type I and type II, which we call multiple orthogonal polynomials of mixed type. Some basic properties are formul...
Evi Daems, Arno B. J. Kuijlaars
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 4 months ago
Types of Cost in Inductive Concept Learning
Inductive concept learning is the task of learning to assign cases to a discrete set of classes. In real-world applications of concept learning, there are many different types of ...
Peter D. Turney