45 search results - page 8 / 9 » jfp 2006 |
JFP
2010
13 years 3 months ago
2010
The aim of our work is to be able to do fully formal, machine verified proofs over Generic Haskellstyle polytypic programs. In order to achieve this goal, we embed polytypic prog...
JFP
2010
13 years 3 months ago
2010
Session types support a type-theoretic formulation of structured patterns of communication, so that the communication behaviour of agents in a distributed system can be verified ...
JFP
2008
13 years 3 months ago
2008
The HM(X) system is a generalization of the Hindley/Milner system parameterized in the constraint domain X. Type inference is performed by generating constraints out of the progra...
JFP
2006
13 years 5 months ago
2006
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have give...
JFP
2006
13 years 5 months ago
2006
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This article presents an appr...