Searched refs:nd (Results 1 - 25 of 46) sorted by relevance

12

/seL4-l4v-10.1.1/isabelle/lib/browser/GraphBrowser/
H A DDirectory.java10 public Directory(TreeNode nd,String n,Vector col) { argument
13 node=nd;
H A DTreeBrowser.java72 public void selectNode(TreeNode nd) { argument
74 nd.select();
78 selected=nd;
H A DTreeNode.java39 TreeNode nd=null;
44 nd=nd2;break;
47 if (nd==null) {
48 nd=new TreeNode(str1,"",-1);
49 leaves.addElement(nd);
51 nd.insertNode(n,str2,p,num,u);
/seL4-l4v-10.1.1/l4v/isabelle/lib/browser/GraphBrowser/
H A DDirectory.java10 public Directory(TreeNode nd,String n,Vector col) { argument
13 node=nd;
H A DTreeBrowser.java72 public void selectNode(TreeNode nd) { argument
74 nd.select();
78 selected=nd;
H A DTreeNode.java39 TreeNode nd=null;
44 nd=nd2;break;
47 if (nd==null) {
48 nd=new TreeNode(str1,"",-1);
49 leaves.addElement(nd);
51 nd.insertNode(n,str2,p,num,u);
/seL4-l4v-10.1.1/HOL4/src/datatype/inftree/
H A DinftreeScript.sml117 (!lf nd a. relrec lf nd (iLf a) (lf a)) /\
118 (!lf nd b df g. (!d. relrec lf nd (df d) (g d)) ==>
119 relrec lf nd (iNd b df) (nd b g))
123 ``!lf nd t r1. relrec lf nd t r1 ==> !r2. relrec lf nd t r2 ==> (r1 = r2)``,
132 ``!t. ?r. relrec lf nd
[all...]
/seL4-l4v-10.1.1/HOL4/examples/fun-op-sem/for/
H A Dfor_nd_semScript.sml54 `(!s c out n nd. <| store := s; clock := c; io_trace := out; input := n; non_det_o := nd |>.store = s) ���
55 (!s nd. (s with non_det_o := nd).store = s.store) ���
255 init_st c nd i =
256 <| store := FEMPTY; clock := c; input := i; io_trace := []; non_det_o := nd |>`;
265 ?c nd i s.
266 sem_t (init_st c nd input) t = (Rval i, s) ���
271 ?c nd r s.
272 sem_t (init_st c nd inpu
[all...]
H A Dfor_ndScript.sml13 In this non-deterministic (nd) version of Chargu��raud's FOR language,
/seL4-l4v-10.1.1/HOL4/polyml/libpolyml/
H A Drealconv.cpp544 BCinfo { int dp0, dp1, dplen, dsign, e0, inexact, nd, nd0, rounding, scale, uflchk; }; member in struct:BCinfo
729 (s, nd0, nd, y9, dplen) CONST char *s; int nd0, nd, dplen; ULong y9; variable
731 (const char *s, int nd0, int nd, ULong y9, int dplen)
738 x = (nd + 8) / 9;
759 for(; i < nd; i++)
2360 int b2, bbits, d2, dd, dig, dsign, i, j, nd, nd0, p2, p5, speccase; variable
2363 nd = bc->nd;
2365 p5 = nd
2568 int esign, i, j, k, nd, nd0, nf, nz, nz0, nz1, sign; variable
[all...]
/seL4-l4v-10.1.1/HOL4/src/num/arith/src/
H A DArith.sml9 (* DATE : 2nd October 1992 *)
/seL4-l4v-10.1.1/HOL4/examples/hardware/hol88/mos-count/
H A Dda.ml18 % 2nd Edition, MacMillan, New York, 1979. %
/seL4-l4v-10.1.1/HOL4/polyml/mlsource/extra/Win/
H A DEdit.sml140 fun printFlags(put, beg, brk, nd) depth _ x =
158 nd ()
H A DListbox.sml143 fun printFlags(put, beg, brk, nd) depth _ x =
161 nd ()
H A DCombobox.sml153 fun printFlags(put, beg, brk, nd) depth _ x =
171 nd ()
H A DScrollbar.sml236 fun printFlags(put, beg, brk, nd) depth _ x =
254 nd ()
H A DStatic.sml177 fun printFlags(put, beg, brk, nd) depth _ x =
195 nd ()
H A DButton.sml201 fun printFlags(put, beg, brk, nd) depth _ x =
219 nd ()
/seL4-l4v-10.1.1/HOL4/examples/fun-op-sem/small-step/
H A Dfor_osmallScript.sml193 { path_to_obs p | p,nd |
194 okpath step_t p ��� complete step_t p ��� first p = (init_st 0 nd input, t_to_small_t prog) })`;
202 load := (\nd t. (init_st 0 nd input , t_to_small_t t));
216 init_st := (\nd. init_st 0 nd input);
1457 (SND (sem_t (init_st 0 nd input with clock := k1) p)).io_trace ���
1458 (SND (sem_t (init_st 0 nd input with clock := k2) p)).io_trace`,
1544 `prefix_chain (over_all (��c. (SND (sem_t (init_st c nd input) t)).io_trace))`,
/seL4-l4v-10.1.1/HOL4/src/num/reduce/Manual/
H A Ddescription.tex77 |- (SUC p) + n = SUC(p + n) % [2] Instance of 2nd conjunct of ADD %
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/
H A DCFG.sml206 let val (nd,nextL) = Graph.fwd (n,cfg); value
212 ( instL := !instL @ [#instr nd];
H A DregAllocation.sml303 val nd = getNodeLab nodeNo; value
304 val (def,use) = (#def nd, #use nd);
306 val inst = #instr(nd);
774 G.ufold (fn ((predL,nodeNo,nd,sucL),gr) =>
775 let val {use = us, def = df, instr = stm} = nd in
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.1/
H A DCFG.sml207 let val (nd,nextL) = Graph.fwd (n,cfg); value
213 ( instL := !instL @ [#instr nd];
H A DregAllocation.sml303 val nd = getNodeLab nodeNo; value
304 val (def,use) = (#def nd, #use nd);
306 val inst = #instr(nd);
774 G.ufold (fn ((predL,nodeNo,nd,sucL),gr) =>
775 let val {use = us, def = df, instr = stm} = nd in
/seL4-l4v-10.1.1/HOL4/examples/dev/sw/working/0.2/
H A DCFG.sml207 let val (nd,nextL) = Graph.fwd (n,cfg); value
213 ( instL := !instL @ [#instr nd];

Completed in 277 milliseconds

12