Results 1 - 10 of 17,869

Compiling polymorphism using intensional type analysis

by Robert Harper, Greg Morrisett - In Symposium on Principles of Programming Languages , 1995
"... The views and conclusions contained in this document are those of the authors and should not be interpreted as ..."
Abstract - Cited by 250 (18 self) - Add to MetaCart
The views and conclusions contained in this document are those of the authors and should not be interpreted as

A Syntactic Approach to Type Soundness

by Andrew K. Wright, Matthias Felleisen - INFORMATION AND COMPUTATION , 1992
"... We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification of the la ..."
Abstract - Cited by 629 (22 self) - Add to MetaCart
We present a new approach to proving type soundness for Hindley/Milner-style polymorphic type systems. The keys to our approach are (1) an adaptation of subject reduction theorems from combinatory logic to programming languages, and (2) the use of rewriting techniques for the specification

Dynamic taint analysis for automatic detection, analysis, and signature generation of exploits on commodity software

by James Newsome, Dawn Song - In Network and Distributed Systems Security Symposium , 2005
"... Software vulnerabilities have had a devastating effect on the Internet. Worms such as CodeRed and Slammer can compromise hundreds of thousands of hosts within hours or even minutes, and cause millions of dollars of damage [32, 51]. To successfully combat these fast automatic Internet attacks, we nee ..."
Abstract - Cited by 647 (32 self) - Add to MetaCart
be used as signatures. Semantic-analysis based signature generation can be more accurate, resilient against polymorphic worms, and robust to attacks exploiting polymorphism than the pattern-extraction based signature generation methods.

Jflow: Practical mostly-static information flow control.

by Andrew C Myers - In Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, , 1999
"... Abstract A promising technique for protecting privacy and integrity of sensitive data is to statically check information flow within programs that manipulate the data. While previous work has proposed programming language extensions to allow this static checking, the resulting languages are too res ..."
Abstract - Cited by 584 (33 self) - Add to MetaCart
restrictive for practical use and have not been implemented. In this paper, we describe the new language JFlow, an extension to the Java language that adds statically-checked information flow annotations. JFlow provides several new features that make information flow checking more flexible and convenient than

Genomic control for association studies

by B. Devlin, Kathryn Roeder , 1999
"... A dense set of single nucleotide polymorphisms (SNP) covering the genome and an efficient method to assess SNP genotypes are expected to be available in the near future. An outstanding question is how to use these technologies efficiently to identify genes affecting liability to complex disorders. ..."
Abstract - Cited by 480 (13 self) - Add to MetaCart
A dense set of single nucleotide polymorphisms (SNP) covering the genome and an efficient method to assess SNP genotypes are expected to be available in the near future. An outstanding question is how to use these technologies efficiently to identify genes affecting liability to complex disorders

Construction of genetic linkage map in man using restriction fragment length polymorphisom

by David Botstein, Raymond L. White, Mark Skolnick, Ronald W. Davis - Am. J. Hum Genet
"... We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random single-copy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests of ..."
Abstract - Cited by 456 (1 self) - Add to MetaCart
We describe a new basis for the construction of a genetic linkage map of the human genome. The basic principle of the mapping scheme is to develop, by recombinant DNA techniques, random single-copy DNA probes capable of detecting DNA sequence polymorphisms, when hybridized to restriction digests

A fast and flexible statistical model for large-scale population genotype data: Applications to inferring missing genotypes and haplotype phase

by Paul Scheet, Matthew Stephens - American Journal of Human Genetics , 2005
"... We present a statistical model for patterns of genetic variation in samples of unrelated individuals from natural populations. This model is based on the idea that, over short regions, haplotypes in a population tend to cluster into groups of similar haplotypes. To capture the fact that, because of ..."
Abstract - Cited by 408 (10 self) - Add to MetaCart
with distance. The resulting model is also fast and, as a result, is practicable for large data sets (e.g., thousands of individuals typed at hundreds of thousands of markers). We illustrate the utility of the model by applying it to dense single-nucleotide–polymorphism genotype data for the tasks of imputing

Theorems for free!

by Philip Wadler - FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE , 1989
"... From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus. ..."
Abstract - Cited by 379 (8 self) - Add to MetaCart
From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus.

Polymorphic effect systems

by John M. Lucassen, David K. Gifford - In Principles of Programming Languages (POPL , 1988
"... We present a new approach to programming lan-guages for parallel computers that uses an effect sys-tem to discover expression scheduling constraints. This effect system is part of a ‘kinded ’ type system with three base kinds: types, which describe the value that an expression may return; effects, w ..."
Abstract - Cited by 270 (2 self) - Add to MetaCart
We present a new approach to programming lan-guages for parallel computers that uses an effect sys-tem to discover expression scheduling constraints. This effect system is part of a ‘kinded ’ type system with three base kinds: types, which describe the value that an expression may return; effects

Dataflow Process Networks

by Edward A. Lee, Thomas Parks - Proceedings of the IEEE , 1995
"... We review a model of computation used in industrial practice in signal processing software environments and experimentally in other contexts. We give this model the name "dataflow process networks," and study its formal properties as well as its utility as a basis for programming language ..."
Abstract - Cited by 325 (32 self) - Add to MetaCart
to functional languages such as Haskell, and show that modern language concepts such as higher-order functions and polymorphism can be used effectively in dataflow process networks. A number of programming examples using a visual syntax are given. This research is part of the Ptolemy project, whi...
Results 1 - 10 of 17,869