Filters








1,982 Hits in 5.9 sec

Building continuous webbed models for system F

S. Berardi, C. Berline
2004 Theoretical Computer Science  
The family generalizes the construction of the model of Barbanera and Berardi (Tech.  ...  Finally, many of its models might be read as two intertwined strict intersection type systems.  ...  Acknowledgements Many thanks to the anonymous referee for his careful reading, his pertinent remarks, and for improving our English.  ... 
doi:10.1016/j.tcs.2003.11.011 fatcat:3s2s7cfjz5drtiesfggjeuojjq

Building continuous webbed models for system F

S. Berardi, C. Berline
2000 Electronical Notes in Theoretical Computer Science  
The family generalizes the construction of the model of Barbanera and Berardi (Tech.  ...  Finally, many of its models might be read as two intertwined strict intersection type systems.  ...  Acknowledgements Many thanks to the anonymous referee for his careful reading, his pertinent remarks, and for improving our English.  ... 
doi:10.1016/s1571-0661(05)80724-8 fatcat:q62r4afeezfpnla7jigfgrhfia

Automated classification of patients with chronic lymphocytic leukemia and immunocytoma from flow cytometric three-color immunophenotypes

G.K. Valet, H.-G. H�ffkes
1997 Cytometry  
It is of interest that the single lambda/CD19/5 antibody triplet provided practically the same information as the full set of the five antibody triplets.  ...  The resulting triple matrix classifiers are laboratory and instrument independent, error tolerant, and robust in the classification of unkown test samples.  ...  Statistical classifiers (23) may produce unstable results, especially when few informative parameters are embedded in a multitude of noninformative parameters, as in multiparameter cytometry.  ... 
doi:10.1002/(sici)1097-0320(19971215)30:6<275::aid-cyto3>3.0.co;2-f pmid:9440819 fatcat:ah7mlqd7j5g37plweqh5z5edim

On Regularity of the Logarithmic Forward Map of Electrical Impedance Tomography

Henrik Garde, Nuutti Hyvönen, Topi Kuutela
2020 SIAM Journal on Mathematical Analysis  
Loosely speaking, thè singularity"" preventing the logarithms of ND maps from mapping L 2 \diamond (\partial\Omega ) to itself is the same for all conductivities, and it thus disappears when subtracting  ...  It is shown that the mapping from the (logarithm of) the conductivity, i.e., the (logarithm of) the coefficient in the divergence term of the studied elliptic partial differential equation, to the logarithm  ...  at the end of section 4.  ... 
doi:10.1137/19m1256476 fatcat:dexnphio6fdwflxoniismoit4a

Beyond static and dynamic scope

Éric Tanter
2009 Proceedings of the 5th symposium on Dynamic languages - DLS '09  
is in effect during the whole reduction of an expression to a value.  ...  Traditional treatment of scoping in programming languages considers two opposite semantics: static scoping, where the scope of a binding is a block of program text, and dynamic scoping, where a binding  ...  For invaluable feedback on different aspects of this work, we thank: Jonathan Aldrich, Dave Clarke, Pascal Costanza, Robby Findler, Oscar Nierstrasz and Guillaume Pothier.  ... 
doi:10.1145/1640134.1640137 dblp:conf/dls/Tanter09 fatcat:ogyusjep2bfgxplavaictipa34

Beyond static and dynamic scope

Éric Tanter
2009 SIGPLAN notices  
is in effect during the whole reduction of an expression to a value.  ...  Traditional treatment of scoping in programming languages considers two opposite semantics: static scoping, where the scope of a binding is a block of program text, and dynamic scoping, where a binding  ...  For invaluable feedback on different aspects of this work, we thank: Jonathan Aldrich, Dave Clarke, Pascal Costanza, Robby Findler, Oscar Nierstrasz and Guillaume Pothier.  ... 
doi:10.1145/1837513.1640137 fatcat:xawgzuidcnbpzjcls4bp6soyr4

Quantum Calculi—From Theory to Language Design

Margherita Zorzi
2019 Applied Sciences  
We also provide the higher-order encoding in the functional languages qPCFand IQu of the well known Deutsch-Jozsa and Simon's algorithms.  ...  We explore the twofold perspective (theoretical and concrete) of the approach and we list the main problems one has to face in quantum language design.  ...  On the other hand, an embedded language allows more direct control of quantum operations and is suitable for the implementation in automatic verification systems.  ... 
doi:10.3390/app9245472 fatcat:ysri3ams6jbsvaxbripdmq7izu

A Type System Describing Unboundedness

Paweł Parys
2018 Discrete Mathematics & Theoretical Computer Science  
We propose a type system that allows to solve the simultaneous-unboundedness problem (SUP) for schemes, which asks, given a set of letters A and a scheme G, whether it is the case that for every number  ...  Using this type system we prove that SUP is (m-1)-EXPTIME-complete for word-recognizing schemes of order m, and m-EXPTIME-complete for tree-recognizing schemes of order m.  ...  Rules of the type system correspond to particular constructs of lambda-calculus.  ... 
doi:10.23638/dmtcs-22-4-2 fatcat:3kuwith7nvcmrp6rva5274k2qq

Computing Integrals [chapter]

Svein Linge, Hans Petter Langtangen
2016 Programming for Computations - Python  
Equally important is a system that can keep track of different versions of the files and the tests, known as a version control system.  ...  in range(len (y) Verification A simple test case is to check the area of a rectangle OE0; 2 OE3; 4:5 embedded in a rectangle OE0; 3 OE2; 5.  ...  g>=0, embedded in a rectangle [x0,x1] x [y0,y1] . n^2 is the number of random points  ... 
doi:10.1007/978-3-319-32428-9_3 fatcat:bnzpxxwhpfd5dbsofsubi37r3e

Taming code explosion in supercompilation

Peter A. Jonsson, Johan Nordlander
2011 Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation - PERM '11  
This allows us to supercompile large parts of the imaginary and spectral parts of nofib in a matter of seconds while keeping the binary size increase below 5%.  ...  Supercompilation algorithms can perform great optimizations but sometimes suffer from the problem of code explosion.  ...  The authors would like to thank Simon Peyton Jones for both ideas and many suggestions to improve the presentation.  ... 
doi:10.1145/1929501.1929507 dblp:conf/pepm/JonssonN11 fatcat:2ndco27tarbypesnebcarx2kyy

Insulator surface flashover due to UV illumination

J. B. Javedani, T.L. Houck, D.A. Lahowe, G.E. Vogtlin, D.A. Goerz
2009 2009 IEEE Pulsed Power Conference  
Qualitatively stated, the testing revealed that the shielding of the cathode triple point against UV is more important than the anode triple junction in the design of vacuum insulators and electrodes.  ...  The surface of an insulator under vacuum and under electrical charge will flashover when illuminated by a critical dose of ultra-violet (UV) radiation -depending on the insulator size and material, insulator  ...  Qualitatively stated, the testing revealed that the shielding of the cathode triple point against UV is more important than the anode triple junction in the design of vacuum insulators and electrodes.  ... 
doi:10.1109/ppc.2009.5386369 fatcat:jjcokfx6anhexkxxwflh62ecvi

Reasoning about effects: from lists to cyber-physical agents

Ian A. Mason, Carolyn L. Talcott
2019 Logical Methods in Computer Science  
Reasoning about actors added the challenge of dealing with distributed open systems of entities interacting asynchronously.  ...  The advent of cyber-physical agents introduces the need to consider uncertainty, faults, physical as well as logical effects.  ...  In §4 we look at distributed systems, where the notions of sequentiality, determinism, and even termination no longer play center stage.  ... 
doi:10.23638/lmcs-15(2:8)2019 fatcat:wmxqvfisprdltfljbp7zdabzlq

A logical framework for software proof reuse

Joshua E. Caplan, Mehdi T. Harandi
1995 Proceedings of the 1995 Symposium on Software reusability - SSR '95  
Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications.  ...  We describe a logical framework PR for verification of reusable software components.  ...  The redundancy in proving *This work is partially supported by NASA grant NAG 1-613 (ICLASS).  ... 
doi:10.1145/211782.211821 dblp:conf/ssr/CaplanH95 fatcat:hfkgyxxcbne4fazisffsc7jlki

A logical framework for software proof reuse

Joshua E. Caplan, Mehdi T. Harandi
1995 Software engineering notes  
Within our system, developers can employ the advantages traditionally associated with software reuse to reduce the cost of software verification by reusing abstract proofs and specifications.  ...  We describe a logical framework PR for verification of reusable software components.  ...  The redundancy in proving *This work is partially supported by NASA grant NAG 1-613 (ICLASS).  ... 
doi:10.1145/223427.211821 fatcat:cwm73zdg5jd63bg43ucabr44cu

Term graph rewriting [chapter]

Jan Willem Klop
1996 Lecture Notes in Computer Science  
The presence of such nodes poses a problem with the definition of homeomorphic embedding. Consider the graphs in Fig. 4 .15.  ...  When we formalize the definition in Fig. 3 .2, we will also use indirection nodes to solve the problem which arose in the construction of the graph of x x x (see Fig. 3 .4).  ...  The call-by-value cyclic lambda calculus is not a cyclic extension, because letrecs may be part of the infinite normal form.  ... 
doi:10.1007/3-540-61254-8_16 fatcat:bpc44eabyfc3fhnfhtxfo5ip2m
« Previous Showing results 1 — 15 out of 1,982 results