1216 search results - page 97 / 244 » Hybrid type checking |
145
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
271
Voted
Book
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
122
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
In the design of type systems for XML programming languages based on regular expression types and patterns the focus has been over result analysis, with the main aim of statically ...
157
click to vote
ENTCS
2008
15 years 3 months ago
2008
The type theory P corresponds to the logical framework LF. In this paper we present H, a variant of P where convertibility is not implemented by means of the customary conversion ...
126
click to vote
ECOOP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Lightweight bytecode verification uses stack maps to annotate Java bytecode programs with type information in order to reduce the verification to type checking. This pape...