Results 291 to 300 of about 2,629,837 (349)
Clonal Diversity and Resistome Dynamics of <i>Acinetobacter baumannii</i> Isolates from Lithuanian National Cancer Center. [PDF]
Medicina (Kaunas)Liveikis T +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, 2002
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating with the outside world. To cope with this problem most languages include some form of dynamic types. It may be that the core language has
Baars, A.I., Swierstra, S.D.
openaire +2 more sources
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating with the outside world. To cope with this problem most languages include some form of dynamic types. It may be that the core language has
Baars, A.I., Swierstra, S.D.
openaire +2 more sources
Abstract types have existential types
Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85, 1985Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value” we call a data algebra . We use a second-order typed lambda calculus SOL to show how data algebras may be
John C. Mitchell, Gordon D. Plotkin
openaire +1 more source
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93, 1993
We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement.
Tobias Nipkow, Christian Prehofer
openaire +1 more source
We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement.
Tobias Nipkow, Christian Prehofer
openaire +1 more source