/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | umsterm.tex | 33 Atoms are considered as functors with zero arity. 133 compound term as opposed to 143 A {\tt list} is either the atom {\tt []} called {\tt nil} as in LISP, 169 Although often used as synonyms, the word {\it predicate} 188 A query has the same form as {\it Body} 191 Such clauses occur mainly as input to the top level Prolog loop
|
H A D | prolog.tex | 36 %(which means to treat programs as data) easy. 47 Integers in {\eclipse} can be as large as fits into the machine's 53 Floating point numbers (represented as IEEE double floats) are written 54 as 145 is written as 151 Lists can be written as a {\tt [Head|Tail]} pair, with the head separated from 186 together called its {\em functor} and is often written as {\em 343 Of course, as long as ther [all...] |
H A D | icintro.tex | 86 equation is true. The \eclipse{} code is as follows: 127 variables. Domain can be specified as a simple range Lo .. Hi, or as a list 331 Note that if a domain ever becomes empty as the result of propagation (no 477 true (or actively false) the constraint will prune domains as though 478 it had been posted as a simple non-reified constraint. 481 \Note{User defined constraints will be treated as reifiable if they appear 482 in an expression context and as such should provide a version with an extra 531 just reason about boolean variables. This means that they can be used as 532 boolean constraints as wel [all...] |
H A D | real.tex | 39 answers being accepted as correct. 65 \item Bounded reals are written as two floating point bounds separated 72 they just occur as the results of computations 110 one bounded real is larger, smaller, or the same as another. This is 173 details. This is important as it means predicates such as sort/2 behave in 227 When writing code such as the above, if \texttt{X} could be a bounded real, 259 \section{IC as a solver for real variables} 298 as well as thei [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | apply.pl | 61 which will be parsed as apply/2 terms which can the be executed. 62 The above example can thus be written as: 79 list Args as additional arguments to Term.
|
H A D | queues.pl | 12 % organising them as detailed here has been funded over 63 In this package, a queue is represented as a term Front-Back, where 155 them in one lump, so that they have the same order in the queue as 172 variable, and in that case this predicate should not succeed, as we 202 lists as queues if you want to. 232 summary:"creates a new queue with the same elements as List", 241 summary:"creates a new list with the same elements as Queue",
|
/barrelfish-2018-10-04/doc/015-disk-driver-arch/ |
H A D | intro.tex | 7 devices. Commands are still transferred as specified in the \ac{ata}/\ac{atapi} 27 encapsulate traditional ATA commands as well as all the lower layers of the 28 interface to the disk, such as the physical layer. 32 value is specified by \ac{ata}. The \ac{fis} contains additional values such as 75 The received \ac{fis} area serves as an area where copies of the \acp{fis}
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/ |
H A D | umslanguage.tex | 60 Structures with the functor \about{book/4} can then be written as% 79 be used in any context and is as efficient as using the structures 123 as follows: 134 Similarly, the whole \pattern{StructName/Arity} specification can be written as 181 Field names of the \verb+person+ structure can now be used as if 190 Note that, as long as the abstract structure notation is used, 191 the \notation{employee} structure can be viewed either as nested or as fla [all...] |
H A D | umstkeclipse.tex | 121 matrix, which can be one dimensional (as in this case), or two 230 which this is done are provided in the \verb'lib_tcl' library as 232 itself, in the file \verb'tkeclipse.pl', can be seen as a more complex 235 In order to use the Tcl/Tk interface, the system must be initialized as 237 probably also be provided as a package using Tcl's package facility, in 245 the error stream to some window so that errors (such as {\eclipse} 275 library. In this case, the development tools are run as a separate program 279 as long as there is the capability for graphical display. 300 their own window as show [all...] |
H A D | umscompiler.tex | 49 predicate. In practice it is best to compile modules as a whole, since 82 This predicate can be used as a shorthand for the 103 created and then used as a static one. 140 The \notation{.ecl} extension can be omitted as long as no file without 142 is present. A \notation{.pl} extension can be omitted as long as no file without 160 If the source is given as \notation{library(\pattern{Name})}, the predicates 189 queue, pipe) can be used as the source for program text. 259 This format represents the code as WA [all...] |
H A D | umsdeveltools.tex | 125 an ECLiPSe source module or file. It is loaded as follows: 136 is distributed as source and serves to provide a framework for the 155 file specified as an atom or string: 171 The checker identifies \notation{Data} and \notation{Datas} as being singleton 176 as \notation{nodiag}. The \bipref{lint/2}{../bips/lib/lint/lint-2.html} 236 same name as the information file, but without the extension. 267 be returned in the format of \notation{lib(graph_algorithms)}, as text, or 268 as a graphical display. 271 as \notation{xref(File,~Options)}. This generates 322 of a file's contents as [all...] |
H A D | umsterm.tex | 72 Atoms are considered as functors with zero arity. 81 written as a conventional identifier (beginning with a lower-case letter), or 138 The six determinism groups are defined as follows: 163 A difference list is written as \about{List - Tail} 180 %element (a ground compound term with as much arguments (integers) as 220 compound term as opposed to being \about{uninstantiated}% 231 as in LISP, 249 at call time. Such a pattern is usually written as a predicate template, e.g., 272 which is written as [all...] |
H A D | exthsusp.tex | 120 % picture has been made with xfig and exported as encapsulated postscript 130 \index{floundering} is sometimes referred to as \defnotion{floundering}. 202 solvers such as the interval solver lib(ic).} 265 The operational semantics of the delay clauses is as follows: 270 if all delay clauses fail, the procedure is executed as usual. 295 As soon as the call is resumed, all delay clauses that may succeed 334 acts as a test: 372 predicate as a delaying condition is useful mainly 418 as soon as on [all...] |
H A D | umsmodules.tex | 114 and same as the base part of the library file name. 138 As a rule, the module name should be chosen to be the same as the 158 Predicates are exported as follows: 191 Initialization goals are exported as follows: 212 interface as a whole, i.e., everything it exports. 240 \bipref{lib/1}{../bips/kernel/compiler/lib-1.html} as in 307 same name as a predicate provided from an imported module. 310 Conflicts of the first type are accepted silently by the system as 311 long as there is no reference to the conflict predicate. Only when an attempt 352 the module in the same way as loca [all...] |
H A D | umsintro.tex | 39 is an open-source software system whose aim is to serve as a platform 75 The documentation is organised as follows: 83 it into an application as a component. 101 %It can be seen as a generic data type or as an attributed variable. 194 %One provides {\it database references} as used in Cprolog, the other 244 %as is the case in most other Prolog systems. 263 %Any input stream can be passed as input to the compiler. 272 %Blocks as suggested by the ISO draft \cite{ISO} are supported 320 %When a predicate is declared as autoloadin [all...] |
/barrelfish-2018-10-04/doc/000-overview/ |
H A D | Overview.tex | 49 This document is intended as an introduction to Barrelfish. 62 OS is structured as a distributed system of single-core processes atop 86 Typically we refer to user level processes (or services or servers) as "user 111 with other cores. CPU drivers can be thought of as serially executing 112 exception handlers for events such as interrupts, faults, and system 146 with good support for best-effort processes as well. 154 A dispatcher can be thought of as the local component of an 166 When a CPU driver decides to run a dispatcher as a result of a 169 as an exit from kernel mode in the manner described below. The 171 user-space thread scheduling, as wel [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/internal/kernel/ |
H A D | io.tex | 64 as needed, since they represent the container itself. 68 in the buffer, so the input can be backed up as much. 73 to be raised can be attached as a property to the stream. 81 host program in a setting where {\eclipse} is embedded as a library 105 character table serves as input to the lexical analyser (it is part 107 A number of other syntax options are configurable as well, e.g.\ 115 former is used by the parser, the latter is as a built-in predicate. 130 The parser (read.c) is implemented as a recursive descent parser in C, 135 read.pl (which can be found as an {\eclipse} third-party library). 141 {\eclipse} will reject some otherwise valid constructs as ambiguou [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/embedding/ |
H A D | embremote.tex | 35 external Tcl program to interact with {\eclipse} in much the same fashion as 62 program. However, as the Tcl and {\eclipse} processes are not as tightly 63 coupled as in an embedded interface, the speed of communications between 70 attached, the Tcl and {\eclipse} processes can communicate much as in the 90 process\footnote{The {\eclipse} side may be more complicated than a simple {\eclipse}, as it can be 108 remote_eclipse}, which can be loaded as follows: 191 such as the control connection and the connection to allow rpc goals to be 220 may be a security concern as 221 this gives the Tcl side as muc [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/ecrc_solvers/ |
H A D | conjunto.pl | 107 delayed and activated as soon as one of the bounds of Sterm or Var is 146 checked and the constraint is delayed. It is activated as soos as the 255 not a known value the constraint is delayed. It is activated as soon as 403 E is not a known value the constraint is delayed. It is activated as 404 soon as E becomes a known value. If Sterm is a ground set and E is 551 Domain has to be a closed set interval specified as Glb..Lub. If SVar 587 activated as soo [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/ |
H A D | intervals.pl | 35 Each set is to be thought of as the union of disjoint intervals, and is 36 represented as a list, each element of which is one such interval. 38 The intervals are represented as 87 This is easy. Sets are represented as lists. We can show that on each 148 This is trivial, as long as the inputs are properly ordered. The 155 This follows in the same way as (3). For 'iset_union', we must take 194 L and U as endpoints. 267 be expressed as one interval. 292 True if I1 union I2 can not be expressed as on [all...] |
H A D | listut.pl | 10 % R.A.O'Keefe, as are nth*, same_length, shorter_list, and subseq*. 91 % Combined apart. E.g. we could define member/2 (from SetUtl.Pl) as 121 % be defined as last(X,L) :- append(_, [X], L). 128 % is true when X and Y appear side-by-side in List. It could be written as 159 % counting the first as element 0. (That is, throw away the first 161 % nth1(?N, ?List, ?Elem) is the same as nth0, except that it counts from 175 first as element 0. (That is, throw away the first N elements 203 first as element 1. 408 % be generated *before S2 as a SubSequence and *after it as [all...] |
/barrelfish-2018-10-04/lib/cxx/unwind/ |
H A D | UnwindRegistersSave.S | 39 movl %edx, 28(%eax) # store what sp was at call site as esp 43 movl %edx, 40(%eax) # store return address as eip 82 movq %rsi,128(%rdi) # store return address as rip 101 stw r0, 0(r3) ; store lr as ssr0 261 str lr, [x0, #0x100] ; store return address as pc 309 str r3, [r0, #60] @ store return address as pc 317 str lr, [r0, #60] @ store return address as pc
|
/barrelfish-2018-10-04/usr/eclipseclp/documents/libman/ |
H A D | extfd.tex | 35 integer as well as atomic (i.e.\ atoms, strings, floats, etc.) 54 treat atomic and other ground terms as variables with singleton domains. 67 An integer interval is written as 147 {\it Domain} can be a closed integer interval denoted as {\it Min .. Max}, 153 is not accepted as a compound domain element. 190 of {\it different} constraints attached to {\it DVar}, as goals 237 as soon as a partial solution is found that is worse than a previously 277 Moreover, as soo [all...] |
H A D | extconjunto.tex | 44 that contain herbrand terms as well as ground sets. Modules that use 140 phase as soon as one domain lower bound $glb_s$ is not included in its 377 And finally we define the cost term as a finite domain used in the 437 % before the labeling as no information would be deduced anyway 538 semantics in order to define the initial search space as small as 543 problems as, packing and partitioning which find their application in 550 element as [all...] |
/barrelfish-2018-10-04/doc/014-bulk-transfer/ |
H A D | bulk-transfer.tex | 52 There are two bulk transport mechanisms that exist in the current(as of August 92 more than two domains as long as the protocol is followed. But current 94 one can use the current implementation with multiple domains as long 95 as the domains are co-operative and applications are willing to deal 107 with network driver which is used as shared memory. Then application 130 the driver as new free pbuf to use. And the location of previous 188 running the driver on same core as an application. In such scenarios 248 \item Avoid data copy as much as possibl [all...] |