Sciweavers

2646 search results - page 96 / 530
» Local Type Inference
Sort
View
IJFCS
2000
71views more  IJFCS 2000»
15 years 2 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
TPHOL
2007
IEEE
15 years 8 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
SIAMCOMP
1998
111views more  SIAMCOMP 1998»
15 years 2 months ago
Computing the Local Consensus of Trees
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
Sampath Kannan, Tandy Warnow
APLAS
2009
ACM
15 years 9 months ago
Fractional Ownerships for Safe Memory Deallocation
We propose a type system for a programming language with memory allocation/deallocation primitives, which prevents memory-related errors such as double-frees and memory leaks. The ...
Kohei Suenaga, Naoki Kobayashi
TLCA
1997
Springer
15 years 6 months ago
Coinductive Axiomatization of Recursive Type Equality and Subtyping
We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by ...
Michael Brandt, Fritz Henglein