Find:
Searching for PHRASE x language.
Restrict to:   Header   Title   Order by:   Expected citations   Hubs   Usage   Date   Try:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP
200 documents found. Order: number of citations.

Points-to Analysis in Almost Linear Time - Steensgaard (1995)   (Correct)   (221 citations)
of the relevant statements, S, of the source language. x, y, f, r, and p range over the (unbounded) set
www.cs.colorado.edu/~diwan/5535-99/steens.ps

Unboxed Values as First Class Citizens in a Non-Strict.. - Jones, Launchbury (1991)   (Correct)   (64 citations)
definition: double x =x x In a non-strict language, x may be unevaluated when double is called, in
ftp.dcs.gla.ac.uk/pub/glasgow-fp/papers/unboxed-values.ps.Z

The Implementation Of Postgres - Stonebraker (1990)   (Correct)   (60 citations)
CLOS (or persistent X for any programming language, X) is inevitably language specific. The run-time
epoch.cs.berkeley.edu:8000/postgres/papers/ERL-M90-34.ps.Z

Points-to Analysis by Type Inference of Programs with.. - Steensgaard (1996)   (Correct)   (47 citations)
of the relevant statements, S, of the source language. x, y, f, r, and p range over the (unbounded)
www-rocq.inria.fr/~thomasse/DEA/Steensgaard96.ps.gz

Object-Oriented Specification of Information.. - Jungclaus, Saake, .. (1991)   (Correct)   (40 citations)
of Information Systems: The T ROLL Language x (Version 0.01) y Ralf Jungclaus Gunter
wwwiti.cs.uni-magdeburg.de/~itiall/ftp/papers/db/91/jshs91.ps.gz

Compiler Construction - Waite, Goos (1984)   (Correct)   (31 citations)
he must ask when designing a compiler for language X on machine Y, what tradeoffs are possible, and
regular expressions can be given for one language. X Y =Y X (commutative) X Y )Z =X Y

i44ftp.info.uni-karlsruhe.de/public_html/papers/ggoos/CompilerConstruction.ps.gz

MONA Implementation Secrets - Klarlund, Møller, al. (2000)   (Correct)   (30 citations)
terms, the logic reduces to a simple \core" language (X ranges over a set of second-order variables)
www.brics.dk/~amoeller/papers/secrets/journal.ps

Logspace and Logtime Leaf Languages - Jenner, McKenzie, Thérien (1996)   (Correct)   (29 citations)
that using a leaf language Y to recognize a language X basically amounts to X dlogtime Y .More
www.iro.umontreal.ca/~mckenzie/jemcth96.ps

The Regular Viewpoint on PA-Processes - Lugiez, Schnoebelen (1998)   (Correct)   (22 citations)
on to Post L) and Pre L) for L a regular language (x 5)These are our main technical results and
www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-1998-3.rr.ps

Recursion Theory on the Reals and Continuous-time Computation - Moore (1995)   (Correct)   (20 citations)
1 (x)h(x y 1) S(h(x y)or, in plainer language, x 0 =x x y 1) x y) 1 Functions
www.santafe.edu/sfi/publications/Working-Papers/95-09-079.ps

Co-ordinating Heterogeneous Parallel Computation - Au, Darlington, Ghanem, Guo, .. (1996)   (Correct)   (18 citations)
computation. In Section 2, we survey the SPP(X) language. In Section 3, we describe performance guided
In this section we briefly outline the SPP(X) language. A more detailed description of the language
code which are written in a base sequential language (X) such as Fortran and C. An application is

hpc.doc.ic.ac.uk/environments/coordination/papers/europar96.ps

Kawa - Compiling Dynamic Languages to the Java VM - Bothner (1998)   (Correct)   (17 citations)
basic ways one might implement some programming language X using Java: One could write an interpreter
solution is speed. If your interpreter for language X is written in Java, which is in turn
# You could write a compiler to translate language X into Java source code. You need to define a

www.math.umd.edu/users/fluo/usenix/technical-conference/freenix/bothner.ps

Co-synthesis and Co-simulation of Control-Dominated.. - Balboni, Fornaciari.. (1996)   (Correct)   (12 citations)
flow a textual specification written in the C x language, a C extension supporting task-level
ftp.elet.polimi.it/outgoing/William.Fornaciari/www_docs/pubblicazioni/ps-papers/DAEMS96.pdf

Constraints over Lambda-Structures in Semantic.. - Egg, Niehren, Xu (1998)   (Correct)   (12 citations)
logic (HOL) formula (9)9) many(language)x:speak(x)john)10) many ffl language
www.coli.uni-sb.de/~egg/Papiere/CLLS-98.ps

Formal Hardware Verification By Symbolic Trajectory Evaluation - Jain (1997)   (Correct)   (9 citations)
Mapping Language .x xi
www.ece.cmu.edu/~jain/thesis.ps.Z

First 20 documents  Next 20

Try your query at:   Google (CiteSeer)   Google (Web)   Yahoo!   MSN   CSB   DBLP

CiteSeer.IST - Copyright Penn State and NEC