Results 271 to 280 of about 651,436 (309)

Ovarian Reserve and Planned Cryopreservation Outcomes in Physicians and Nonphysicians. [PDF]

open access: yesO G Open
Luck M   +8 more
europepmc   +1 more source

Recursive type generativity

Journal of Functional Programming, 2005
Abstract Existential types provide a simple and elegant foundation for understanding generative abstract data types of the kind supported by the Standard ML module system. However, in attempting to extend ML with support for recursive modules, we have found that the traditional existential account of type ...
openaire   +1 more source

Generalized conjunctive types

Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89, 1989
The definitions of Conjunctive types and their subtype relation, as introduced by Coppo-Dezani, are extended to consider the conjunction as a partial mapping from pairs of types to types, and the subtype relation as a relation between finite sets of types and types.
openaire   +1 more source

Generalized Spherical type hypersurfaces

Differential Geometry and its Applications, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
W. S Ruys, A.M.V. Corro
openaire   +2 more sources

A generator for type checkers.

2005
Compiler-compiler generieren aus formalen Spezifikationen Komponenten für Compiler, um dort handgeschriebenen Code ersetzen. Solche Generatoren existieren für die lexikalische, syntaktische und semantische Anlayse, für Optimierer und die Coderzeugung.
openaire   +3 more sources

Towards gradual typing for generics

Proceedings for the 1st workshop on Script to Program Evolution, 2009
Gradual typing, proposed by Siek and Taha, is a framework to combine the benefits of static and dynamic typing. Under gradual typing, some parts of the program are type-checked at compile time, and the other parts are type-checked at run time. The main advantage of gradual typing is that a programmer can write a program rapidly without static type ...
Lintaro Ina, Atsushi Igarashi
openaire   +1 more source

Random Generators for Dependent Types

2005
We show how to write surjective random generators for several different classes of inductively defined types in dependent type theory. We discuss both non-indexed (simple) types and indexed families of types. In particular we show how to use the relationship between indexed inductive definitions and logic programs: the indexed inductive definition of a
Peter Dybjer   +2 more
openaire   +1 more source

About data type genericity

1981
The notion of genericity and polymorphism is of main interest in the field of abstract data types. Semantic models based on a domain of retracts and continuous functions (theory of Strachey-Scott) are not sufficient to describe some specific aspects of genericity.
Didier Bert, Roger Soler
openaire   +1 more source

Generalized gradients of monotone type

Nonlinear Analysis: Theory, Methods & Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Home - About - Disclaimer - Privacy