Results 1 - 10 of 617

Abstract

by unknown authors
"... We present m interprocedural flow-lnsensltlve points-to rmalysls based on type]nference methods with an almost hneart ime cost complexity To our knowled~e, this is the asymptotically fastest non-trlwzd lnterprocedural points-to analysis algorlthm yet described The al,gotnthm IS bmedona non-standard ..."
Abstract - Add to MetaCart
-standard type system. The type Inferred for any wmable l-epl-esents a set of locations and includes a type which in turn represents a set ot ’ locations possibly pointed to by the variable. Thetype inferred for a function variable l-epre-sents a set of functions It may point to and Includes a type signature

Abstract

by Franklyn Turbak, Allyn Dimock, Robert Muller, J. B. Wells , 1997
"... Optimizing compilers for function-oriented and object-oriented languages exploit type and flow information for efficient implementation. Although type and flow information (both control and data flow) are inseparably intertwined, compilers usually compute and represent them separately. Partially, th ..."
Abstract - Add to MetaCart
Optimizing compilers for function-oriented and object-oriented languages exploit type and flow information for efficient implementation. Although type and flow information (both control and data flow) are inseparably intertwined, compilers usually compute and represent them separately. Partially

Abstract

by Janis Voigtländer, Technische Universität Dresden, Patricia Johann
"... Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. The formal background of such ‘free theorems ’ is well developed for extensions of the Girard-Reynolds ..."
Abstract - Add to MetaCart
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., virtually for free. The formal background of such ‘free theorems ’ is well developed for extensions of the Girard

Proof Pearl: A New Foundation for Nominal Isabelle

by Brian Huffman, Christian Urban
"... Abstract. Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a theorem prover environment, in our case Isabelle/HOL. We present a formalisation of this work that differs from ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
from our earlier approach in two important respects: First, instead of representing permutations as lists of pairs of atoms, we now use a more abstract representation based on functions. Second, whereas the earlier work modeled different sorts of atoms using different types, we now introduce a unified

Features – abstract data types, polymorphism, control structures.

by Antonio Cisternino, Andrew Kennedy
"... We present a framework for code generation that allows programs to manipulate and generate code at the source level while the joining and splicing of executable code is carried out automatically at the intermediate code/VM level. The framework introduces a data type Code to represent code fragments: ..."
Abstract - Add to MetaCart
We present a framework for code generation that allows programs to manipulate and generate code at the source level while the joining and splicing of executable code is carried out automatically at the intermediate code/VM level. The framework introduces a data type Code to represent code fragments

Materials for an exploratory theory of the network society.

by Manuel Castells , Anthony Giddens , Alain Touraine , Anthony Smith , Benjamin Barber , Peter Hall , Roger-Pol Droit , Sophie Watson , Frank Webster , Krishan Kumar , David Lyon , Craig Calhoun , Jeffrey Henderson , Ramon Ramos , Jose E Rodrigues-Ibanez , Jose F Tezanos , Mary Kaldor , Stephen Jones , Christopher Freeman - The British Journal of Sociology , 2000
"... ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world, in v ..."
Abstract - Cited by 122 (0 self) - Add to MetaCart
ABSTRACT This article aims at proposing some elements for a grounded theor y of the network society. The network society is the social structure characteristic of the Information Age, as tentatively identi ed by empirical, cross-cultural investigation. It permeates most societies in the world

Indicators for Social and Economic Coping Capacity - Moving Toward a Working Definition of Adaptive Capacity”, Wesleyan-CMU Working Paper.

by Gary Yohe , Richard S J Tol , Gary Yohe , 2001
"... Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly on the u ..."
Abstract - Cited by 109 (14 self) - Add to MetaCart
Abstract This paper offers a practically motivated method for evaluating systems' abilities to handle external stress. The method is designed to assess the potential contributions of various adaptation options to improving systems' coping capacities by focusing attention directly

A Type System Equivalent to Static Single Assignment ⋆,⋆⋆ Abstract

by Yutaka Matsuno, Atsushi Ohori
"... This article develops a type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach this program point. For this type system, we establish that a derivable typing ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
This article develops a type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach this program point. For this type system, we establish that a derivable

Abstract PolyAML: A Polymorphic Aspect-oriented Functional Programming Language

by Daniel S. Dantas, David Walker
"... This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type analysis and aspect-oriented programming language features. In particular, PolyAML allows programmers to define type-safe ..."
Abstract - Add to MetaCart
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type analysis and aspect-oriented programming language features. In particular, PolyAML allows programmers to define type

Abstract A Type System Equivalent to Static Single Assignment ∗

by unknown authors
"... This paper develops a static type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach the program point. For this type system, we show that a derivable typing ..."
Abstract - Add to MetaCart
This paper develops a static type system equivalent to static single assignment (SSA) form. In this type system, a type of a variable at some program point represents the control flows from the assignment statements that reach the program point. For this type system, we show that a derivable typing
Results 1 - 10 of 617