Search
Search Funnelback University
- Refined by:
- Date: 2002
Did you mean pc524?
51 -
60 of
373
search results for :pc53 24 /
where 0
match all words and 373
match some words.
Results that match 1 of 2 words
-
TR082.dvi
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-82.pdf26 Sep 2002: The TPS theorem prover uses sophisticated heuristics in the search for higher-orderunifiers [24]. -
P01-quiz.dvi
https://www.cl.cam.ac.uk/teaching/2002/OSFounds/MemMgtQu.pdf30 Oct 2002: #" $&%(' ),'-$/. 01)324'65&%78%/99:2;.<=,<>?%/@A. BDC% >?2EBF@A.<=HG. IKJ. L'M@$ % >DBN=L)PO17Q. RTS <>?%/@A. CUB2% >&2EBF@A.<= )3V %WNXZY[O!)']%2;@&$1)'=.@L'-52_! S=<5. '6$&%a'b'-$/. c I BF@A@&5d>!)e.<$?%7Cf'6$? RTS <>?%/@A. hgiV?@&735/9. D B24j %>> -
TR175.dvi
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-175.pdf26 Sep 2002: The logic programming language λProlog, though based on higher-order logic,. forbids quantification over bool [24]. ... Springer, 1989. [24] G. Nadathur. A Higher-Order Logic as the Basis for Logic Programming. -
TR057.dvi
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-57.pdf26 Sep 2002: Jan Smith [24] defines Quicksort in Type Theory by first derivingappropriate rules of induction and recursion, using primitive recursion over higher types.The “while rule” of Backhouse and Khamiss [1] is ... l,d〉 = l′ ) l. 24. 12.2 Induction. -
D:DTFA02207.DVI
www.damtp.cam.ac.uk/user/ngb23/publications/sphere.pdf24 Sep 2002: 21r5+. 24. 11r4 10. 21r2. ]P5(cos θ). ). (32). From this we can determine the first function of (18):. ... Wesubstitute r = 1 ξ in (37), expand the solution in powers of , and note that the last term in(24) is O(ξ) for ξ. -
slides.dvi
https://www.cl.cam.ac.uk/teaching/2001/OpSys/slides.pdf11 Apr 2002: 0x1008 5 Integer 5. 0x100C 0x0F3C Address of inner node. Computer Organisation | Memory (Programmer's Point of View) Tim Harris | 24. ... 00 I Opcode S Ra Rd Operand 2. 31 25 24 21 20 19 16 15 1211 026. -
TR130.dvi
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-130.pdf26 Sep 2002: 24. 7 Other representations of eigenvariables. We have seen how to express most forms of Isabelle-86 proof construction as formalinference in a meta-logic. -
javacase.dvi
https://www.cl.cam.ac.uk/teaching/2002/JavaCaseStudy/javacase.pdf4 Dec 2002: double h = radians(hour360.0/24.0 - longitude);. double sinh = Math.sin(h);. double cosh = Math.cos(h);. ... if (penDown) m.tracePoint(null);. }. if(hour>=24) { hour -= 24; day++; }. day = dayStep;. if(day>daysInMonth(month)) {. day -= daysInMonth(month); -
Internet traffic engineering
https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-532.pdf6 Apr 2002: Technical ReportNumber 532. Computer Laboratory. UCAM-CL-TR-532ISSN 1476-2986. Internet traffic engineering. Richard Mortier. April 2002. JJ Thomson Avenue. Cambridge CB3 0FD. United Kingdom. phone 44 1223 763500. http://www.cl.cam.ac.uk/. c 2002 -
An open source grammar development environment and…
https://www.cl.cam.ac.uk/~aac10/papers/lrec2000.pdf8 Jun 2002: every dog probably chased some white cat. Full notation:266664. TOPh1. LZT <. prpstn relHNL h1SOAh21. ;. 24. every relHNL h3BV x4RESTRh5BODY h6. 35;. ... dog relHNL h8INST x4. ;. probably rel. HNL h9ARG h10. ;. 2664. chasev relHNL h12. EVENT e2h.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.