Sciweavers

7555 search results - page 6 / 1511
» The Type System of DBPL
Sort
View
SCP
2010
155views more  SCP 2010»
13 years 6 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
PLPV
2012
ACM
12 years 3 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey
DLS
2009
150views Languages» more  DLS 2009»
13 years 5 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...
DBPL
2007
Springer
98views Database» more  DBPL 2007»
14 years 1 months ago
Towards Practical Typechecking for Macro Tree Transducers
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
Alain Frisch, Haruo Hosoya
DBPL
1999
Springer
114views Database» more  DBPL 1999»
13 years 11 months ago
Structured Document Transformations Based on XSL
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
Sebastian Maneth, Frank Neven