Results 191 to 200 of about 9,900 (232)
Some of the next articles are maybe not open access.
ACM SIGPLAN Notices, 2011
Linearity is a multi-faceted and ubiquitous notion in the analysis and the development of programming language concepts. We study linearity in a denotational perspective by picking out programs that correspond to linear functions between coherence spaces. We introduce a language, named Sl PCF *
Gaboardi M., Paolini L., Piccolo M.
openaire +3 more sources
Linearity is a multi-faceted and ubiquitous notion in the analysis and the development of programming language concepts. We study linearity in a denotational perspective by picking out programs that correspond to linear functions between coherence spaces. We introduce a language, named Sl PCF *
Gaboardi M., Paolini L., Piccolo M.
openaire +3 more sources
Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication, 2020
Recently, traffic engineering mechanisms have been developed that guarantee that a network (cloud provider WAN, or ISP) does not experience congestion under failures. In this paper, we show that existing congestion-free mechanisms, notably FFC, achieve performance far short of the network's intrinsic capability.
Chuan Jiang +2 more
openaire +1 more source
Recently, traffic engineering mechanisms have been developed that guarantee that a network (cloud provider WAN, or ISP) does not experience congestion under failures. In this paper, we show that existing congestion-free mechanisms, notably FFC, achieve performance far short of the network's intrinsic capability.
Chuan Jiang +2 more
openaire +1 more source
Journal of Symbolic Logic, 2000
AbstractWe deal with several pcf problems: we characterize another version of exponentiation: maximal number ofk-branches in a tree withλnodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras.
openaire +1 more source
AbstractWe deal with several pcf problems: we characterize another version of exponentiation: maximal number ofk-branches in a tree withλnodes, deal with existence of independent sets in stable theories, possible cardinalities of ultraproducts and the depth of ultraproducts of Boolean Algebras.
openaire +1 more source
2011
This chapter introduces a specific programming language called PCF (and sometimes mini-ML). This language is one of the backbones of the book. It will be evaluated, interpreted, compiled, and extended (with types, references, records and objects) in the rest of the book.
Gilles Dowek, Jean-Jacques Lévy
openaire +1 more source
This chapter introduces a specific programming language called PCF (and sometimes mini-ML). This language is one of the backbones of the book. It will be evaluated, interpreted, compiled, and extended (with types, references, records and objects) in the rest of the book.
Gilles Dowek, Jean-Jacques Lévy
openaire +1 more source
Design and Comparison of CA-PCF and EA-PCF for Dispersion Property
2012 International Conference on Communication Systems and Network Technologies, 2012In this paper we compare and analyze the design of circular air hole with elliptical air holes for the total dispersion property of both the configuration. By varying the size of the air holes it is possible to obtain the flattened dispersion for the wavelength range 1.2 nm to 1.6 nm range.
Harish Singh Kanyal +2 more
openaire +1 more source
2011
This chapter opens a new part of the book, dedicated to types. The language PCF is extended by adding types. A type verification algorithm is described and the application to the static detection of errors is discussed in length. This chapter also describes the denotational semantics of PCF with types.
Gilles Dowek, Jean-Jacques Lévy
openaire +1 more source
This chapter opens a new part of the book, dedicated to types. The language PCF is extended by adding types. A type verification algorithm is described and the application to the static detection of errors is discussed in length. This chapter also describes the denotational semantics of PCF with types.
Gilles Dowek, Jean-Jacques Lévy
openaire +1 more source
Transmission Characteristics of Circular Ring PCF and Octagonal PCF: A Comparison
2006 International Conference on Electrical and Computer Engineering, 2006This paper presents the chromatic dispersion, effective area and confinement loss in circular ring photonic crystal fibers (CPCFs) in comparison to the octagonal PCFs (OPCFs). The finite difference method (FDM) with perfectly matched boundary layers (PML) is used to analyze the dispersion and leakage properties.
S. M. A. Razzak +4 more
openaire +1 more source
Operational and axiomatic semantics of PCF
Proceedings of the 1990 ACM conference on LISP and functional programming, 1990PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms for PCF include e-equivalence and the so-called “surjective pairing” axiom for pairs.
Brian T. Howard, John C. Mitchell
openaire +1 more source
Singular Cardinals and the PCF Theory
Bulletin of Symbolic Logic, 1995§1. Introduction. Among the most remarkable discoveries in set theory in the last quarter century is the rich structure of the arithmetic of singular cardinals, and its deep relationship to large cardinals. The problem of finding a complete set of rules describing the behavior of the continuum function 2ℵαfor singular ℵα's, known as theSingular ...
openaire +2 more sources