7529 search results - page 145 / 1506 » The Modula-3 Type System |
153
click to vote
MPC
2010
Springer
15 years 9 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
146
click to vote
CSFW
1997
IEEE
15 years 8 months ago
1997
IEEE
A type system is given that eliminates two kinds of covert flows in an imperative programming language. The first kind arises from nontermination and the other from partial oper...
127
click to vote
APLAS
2007
ACM
15 years 8 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
170
click to vote
TLCA
1995
Springer
15 years 8 months ago
1995
Springer
operator abstraction is a language construct relevant to object oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce Fω ≤, a ...
144
click to vote
FOSSACS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper, we show how Miquel's Implicit Calculus of Constructions (ICC) can be used as a programming language featuring dependent types. Since this system has a...