Filters








27,232 Hits in 5.3 sec

Semantics of a sequential language for exact real-number computation

J. Raymundo Marcial-Romero, Martín H. Escardó
2007 Theoretical Computer Science  
We study a programming language with a built-in ground type for real numbers.  ...  The non-deterministic nature of the construction suggests the use of powerdomains in order to obtain a denotational semantics for the language.  ...  Acknowledgements We thank Achim Jung, Paul Levy, Steve Vickers and Andrew Moshier for comments and suggestions.  ... 
doi:10.1016/j.tcs.2007.01.021 fatcat:aa4hels7dzhblnbookd27p65yq

Lazy functional algorithms for exact real functionals [chapter]

Alex K. Simpson
1998 Lecture Notes in Computer Science  
We show how functional languages can be used to write programs for real-valued functionals in exact real arithmetic.  ...  The algorithms are a practical application of a method, due to Berger, for computing quanti ers over streams. Correctness proofs for the algorithms make essential use of domain theory.  ...  I thank Ieke Moerdijk, Jaap van Oosten and Harold Schellinx for their hospitality in Utrecht, where the paper was written with nancial support from an NWO Pionier Project.  ... 
doi:10.1007/bfb0055795 fatcat:uqktylp2tvgererwzubjg7ugfe

Page 4576 of Mathematical Reviews Vol. , Issue 98G [page]

1998 Mathematical Reviews  
John Shawe-Taylor (4-LNDHB-C; Egham) 98¢:68099 68Q55 65G05 68Q05 Edalat, Abbas (4-LNDIC-C; London); Potts, Peter John (4-LNDIC-C; London) A new representation for exact real numbers.  ...  real number lies.  ... 

Comparing Functional Paradigms for Exact Real-Number Computation [chapter]

Andrej Bauer, Martín Hötzel Escardó, Alex Simpson
2002 Lecture Notes in Computer Science  
We compare the definability of total functionals over the reals in two functional-programming approaches to exact real-number computation: the extensional approach, in which one has an abstract datatype  ...  of real numbers; and the intensional approach, in which one encodes real numbers using ordinary datatypes.  ...  Under the intensional approach to exact real-number computation, one needs to select a computationally admissible representation of real numbers [WK87] . There are many equivalent choices.  ... 
doi:10.1007/3-540-45465-9_42 fatcat:2hnypgcb7fal7dvjfqj5yegdoq

Collaborative Filtering for Book Recommandation

Chahinez Benkoussas, Hussam Hamdan, Shereen Albitar, Anaïs Ollagnier, Patrice Bellot
2014 Conference and Labs of the Evaluation Forum  
In addition, we tested the combination of the Sequential Dependence Model (SDM) and the use of social information that takes into account ratings,tags and customer reviews, we also tested several query  ...  In our experiments we used dierent methods, one of our submissions which uses INL2 got the second rank w.r.t nDCG@10 measure, the ocial measure for this task.  ...  We computed a social score for each book, considering the amount of reviews and the ratings.  ... 
dblp:conf/clef/BenkoussasHAOB14 fatcat:voxf3xsgjna6bjtwmzcxqv7c6a

Syntax and semantics of PRETSEL-a specification language for parallel real-time systems

A. Choudhary, V. Gehlot, B. Narahari
1996 Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences  
For many real-time applications (e.g. Command, Control, and Communications), parallel computers offer a natural computing platform.  ...  The PRETSEL specification language is based on a traditional two-level view of parallel computing whereby a parallel computation is viewed as a collection of interacting (data) parallel algorithms.  ...  In this paper we propose a formal specification language called PRETSEL-Parallel REal Time SpEcification Language-for real-time systems implemented on parallel machines.  ... 
doi:10.1109/hicss.1996.495502 dblp:conf/hicss/ChoudharyGN96 fatcat:h5t75j6ywbfq3etxoxkdggq2nm

Real-time spoken language translation using associative processors

Kozo Oi, Eiichiro Sumita, Osamu Furuse, Hitoshi Iida, Tetsuya Higuchi
1994 Proceedings of the fourth conference on Applied natural language processing -  
This paper proposes a model using associative processors (APs) for real-time spoken language translation. Spoken language translation requires (1) an accurate translation and (2) a realtime response.  ...  Thus, our model, TDMT on APs, meets the vital requirements of spoken language translation.  ...  Careful analysis of the computational cost in the sequential TDMT prototype has revealed that the ER for the top 10 SEs (source language expressions) accounts for nearly 96% of the entire ER time.  ... 
doi:10.3115/974358.974381 dblp:conf/anlp/OiSFIH94 fatcat:yhp2tyctkrezbelxjd5pq7445a

Sequentiality and Piecewise-affinity in Segments of Real-PCF

Amin Farjudian
2004 Electronical Notes in Theoretical Computer Science  
Real PCF (RPCF) was proposed by Martín Escardó [8] as a language for Real number computation.  ...  While search is being undertaken to replace pif I with a more efficient operator, one needs to be assured of the segment of RPCF without pif I being sequential.  ...  Acknowledgement Achim Jung -my supervisor -suggested the problem of sequentiality of wRPCF and the definition of the generalized Vuillemin-sequentiality, i.e. Definition 2.4, page 26.  ... 
doi:10.1016/j.entcs.2004.08.002 fatcat:kqv3mhh6dzhshimladtzqa436y

Reduction Strategies for Declarative Programming

Michael Hanus
2001 Electronical Notes in Theoretical Computer Science  
On the other hand, they should also support the programmers to write programs in a declarative way ignoring the influence of the evaluation strategy to the success of a computation as good as possible.  ...  Reasonable reduction strategies for declarative languages must be efficiently implementable to be useful in practice.  ...  As discussed above, this is not a real restriction for programming languages but always satisfied if functions are defined in a constructive way.  ... 
doi:10.1016/s1571-0661(04)00273-7 fatcat:jtcnfes5ireuxlctdpm6nxkehm

An abstract data type for real numbers

Pietro Di Gianantonio
1999 Theoretical Computer Science  
We present a calculus having real numbers as a basic data type. The calculus is defined by its denotational semantics. We prove the universality of the calculus.  ...  Di Gianantonio/ Theoretical Computer Science 221 (1999) 295-326 297 programming languages can be discussed in this setting. For completeness, we give here the basic definition of PCF [18].  ...  Acknowledgements The research presented in this paper was started at the departement of Computing, Imperial College London, where the author spent a few months as a research fellow thanks to an EPSRC grant  ... 
doi:10.1016/s0304-3975(99)00036-5 fatcat:xv3x2ktwijcpjir5kraitxx3ia

An abstract data type for real numbers [chapter]

Pietro Gianantonio
1997 Lecture Notes in Computer Science  
We present a calculus having real numbers as a basic data type. The calculus is defined by its denotational semantics. We prove the universality of the calculus.  ...  Di Gianantonio/ Theoretical Computer Science 221 (1999) 295-326 297 programming languages can be discussed in this setting. For completeness, we give here the basic definition of PCF [18].  ...  Acknowledgements The research presented in this paper was started at the departement of Computing, Imperial College London, where the author spent a few months as a research fellow thanks to an EPSRC grant  ... 
doi:10.1007/3-540-63165-8_170 fatcat:yihzh7smebfljp4up6bz5reuiy

Syntactical and semantical aspects of Faust

Y. Orlarey, D. Fober, S. Letz
2004 Soft Computing - A Fusion of Foundations, Methodologies and Applications  
This paper presents some syntactical and semantical aspects of FAUST (Functional AUdio STreams), a programming language for real-time sound processing and synthesis.  ...  It has a well defined formal semantic and can be compiled into efficient C/C++ code.  ...  It requires that the number of inputs of B is an exact multiple of the number of outputs of A.  ... 
doi:10.1007/s00500-004-0388-1 fatcat:q4amoz57ezaibemgy4zzbqa7g4

Practical probabilistic programming with monads

Adam Ścibior, Zoubin Ghahramani, Andrew D. Gordon
2015 Proceedings of the 8th ACM SIGPLAN Symposium on Haskell - Haskell 2015  
We use a GADT as an underlying representation of a probability distribution and apply Sequential Monte Carlo-based methods to achieve efficient inference.  ...  Such systems come in different forms, but they all express probabilistic models as computational processes using syntax resembling programming languages.  ...  Jeremy Gibbons pointed out that the construction of the HMM presented in section 2.5 is in fact a fold over the data.  ... 
doi:10.1145/2804302.2804317 dblp:conf/haskell/ScibiorGG15 fatcat:zpbxn22bmfg4xoqionwqyqy7d4

Practical probabilistic programming with monads

Adam Ścibior, Zoubin Ghahramani, Andrew D. Gordon
2015 SIGPLAN notices  
We use a GADT as an underlying representation of a probability distribution and apply Sequential Monte Carlo-based methods to achieve efficient inference.  ...  Such systems come in different forms, but they all express probabilistic models as computational processes using syntax resembling programming languages.  ...  Jeremy Gibbons pointed out that the construction of the HMM presented in section 2.5 is in fact a fold over the data.  ... 
doi:10.1145/2887747.2804317 fatcat:xxc7tfnhp5fhfosuwz3h7v2qh4

Page 6543 of Mathematical Reviews Vol. , Issue 87k [page]

1987 Mathematical Reviews  
ISBN 0-273-08722-3 This monograph gives a concrete approach to the semantics of sequential programming languages.  ...  It is a comprehensive discussion of sequential algorithms, their theory and their implementation, which previ- ously was scattered over a number of independent publications. E. Fehr (St.  ... 
« Previous Showing results 1 — 15 out of 27,232 results