Sciweavers

1313 search results - page 6 / 263
» Generic Universe Types
Sort
View
TLDI
2009
ACM
100views Formal Methods» more  TLDI 2009»
14 years 3 months ago
Typed transformations of typed abstract syntax
Syntax Arthur Baars Doaitse Swierstra Technical Report UU-CS-2008-021 July 2008 Department of Information and Computing Sciences Utrecht University, Utrecht, The Netherlands www.cs...
Arthur I. Baars, S. Doaitse Swierstra, Marcos Vier...
FPCA
1989
13 years 10 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
AAIP
2009
13 years 7 months ago
Enumerating Well-Typed Terms Generically
We use generic programming techniques to generate well-typed lambda terms. We encode well-typed terms by generalized algebraic datatypes (GADTs) and existential types. The Spine a...
Alexey Rodriguez Yakushev, Johan Jeuring
ICALP
2000
Springer
13 years 10 months ago
Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type System
We introduce a generic type system (based on Milner's sort system) for the synchronous polyadic -calculus, allowing us to mechanise the analysis of input/output capabilities o...
Barbara König
PPDP
2010
Springer
13 years 5 months ago
Generic record combinators with static type checking
Common record systems only provide access to individual record fields. However, it is often useful to have generic record combinators, that is, functions that work with complete ...
Wolfgang Jeltsch