Sciweavers

3443 search results - page 103 / 689
» More Algebras for Determiners
Sort
View
DAGSTUHL
2001
13 years 9 months ago
Indexed Induction-Recursion
We give two finite axiomatizations of indexed inductive-recursive definitions in intuitionistic type theory. They extend our previous finite axiomatizations of inductive-recursive...
Peter Dybjer, Anton Setzer
SLP
1994
118views more  SLP 1994»
13 years 9 months ago
A Simple Program Transformation for Parallelism
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
Saumya K. Debray, Mudita Jain
DM
2008
129views more  DM 2008»
13 years 8 months ago
On association schemes all elements of which have valency 1 or 2
In the present note, we investigate schemes S in which each element s satisfies ns 2 and nss = 2. We show that such a scheme is schurian. More precisely, we show that it is isomor...
Mikhail E. Muzychuk, Paul-Hermann Zieschang
CORR
2007
Springer
139views Education» more  CORR 2007»
13 years 8 months ago
Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...
Saugata Basu
LISP
2006
91views more  LISP 2006»
13 years 8 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier