Sciweavers

429 search results - page 39 / 86
» Parameter-free polymorphic types
Sort
View
LFCS
1994
Springer
15 years 3 months ago
Comparing Cubes
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt's typed -cube [4]. The first is obtained from the latter through applying...
Steffen van Bakel, Luigi Liquori, Simona Ronchi De...
IJFCS
2000
71views more  IJFCS 2000»
14 years 11 months ago
Light Affine Logic as a Programming Language: A First Contribution
This work is about an experimental paradigmatic functional language for programming with P-TIME functions. The language is designed from Intuitionistic Light Affine Logic. It can ...
Luca Roversi
LFP
1994
113views more  LFP 1994»
15 years 1 months ago
Collecting More Garbage
We present a method, adapted to polymorphically typed functional languages, to detect and collect more garbage than existing GCs. It can be applied to strict or lazy higher order ...
Pascal Fradet
ICLP
2003
Springer
15 years 5 months ago
Termination Analysis with Types Is More Accurate
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
Vitaly Lagoon, Frédéric Mesnard, Pet...
BMCBI
2004
148views more  BMCBI 2004»
14 years 11 months ago
Bioinformatics analysis of SARS coronavirus genome polymorphism
Background: We have compared 38 isolates of the SARS-CoV complete genome. The main goal was twofold: first, to analyze and compare nucleotide sequences and to identify positions o...
Gordana Pavlovic-Lazetic, Nenad S. Mitic, Milos V....