I hereby claim:
- I am maurer on github.
- I am maurer (https://keybase.io/maurer) on keybase.
- I have a public key whose fingerprint is 4FC8 8C78 6C61 B05B EEE8 3E32 AF15 E48C B1E3 A490
To claim this, I am signing this object:
| maurer@caladbolg ~/CMU/411/lab1/haskell/bin $ ls -gh | |
| total 0 | |
| lrwxrwxrwx 1 maurer 21 Aug 12 15:44 c0c -> ../dist/build/c0c/c0c | |
| lrwxrwxrwx 1 maurer 3 Aug 12 15:45 l1c -> c0c | |
| lrwxrwxrwx 1 maurer 3 Aug 12 15:45 l2c -> c0c | |
| lrwxrwxrwx 1 maurer 3 Aug 12 15:45 l3c -> c0c | |
| lrwxrwxrwx 1 maurer 3 Aug 12 15:45 l4c -> c0c | |
| lrwxrwxrwx 1 maurer 3 Aug 12 15:45 l5c -> c0c |
| running> *** ASSERTION ERROR: | |
| in /disk2/mp-local/simics-4.0/src/cpu/x86/p2_processor_class.c:2352 | |
| Simics core: 2590 Tue Dec 22 18:05:09 2009 | |
| Module: 2589 Wed Dec 16 18:05:13 2009 | |
| Please report this. | |
| Simics will now self-signal an abort. | |
| Abort (SIGABRT) in main thread | |
| #0 0x00007f3d55e04a45 in gsignal + 0x35 (/lib64/libc.so.6 + 0x32a45) | |
| #1 0x00007f3d55e4e6a0 in __default_morecore + 0x0 (/lib64/libc.so.6 + 0x7c6a0) | |
| #2 0x00007f3d5615d8e3 in _IO_2_1_stderr_ + 0x83 (/lib64/libc.so.6 + 0x38b8e3) |
| echo isrs: # Handle to table | |
| for n in `seq 0 255` # For each possible IRQ | |
| do | |
| echo .long isr_$n # emit a function pointer | |
| done |
| >{-# LANGUAGE TypeFamilies, ScopedTypeVariables #-} | |
| >module Modules where | |
| Since all modules under this translation must ascribe to some signature, | |
| we by providing a signature for a module which provides equality over | |
| some type. | |
| >class EQ mod where | |
| > type EQV mod :: * | |
| > eq :: mod -> EQV mod -> EQV mod -> Bool |
| {- | |
| This works. | |
| -} | |
| {- | |
| This doesn't: let x = y in z | |
| -} |
| {- | |
| This works. | |
| -} | |
| {- | |
| This doesn't: let x = y in z | |
| -} |
I hereby claim:
To claim this, I am signing this object:
| open Core_kernel.Std | |
| open Bap_types.Std | |
| module type S = sig | |
| type t | |
| type node | |
| val pred : t -> node -> node list | |
| val succ : t -> node -> node list | |
| val code : t -> node -> Bil.stmt list | |
| val asm : t -> node -> string list |
| <div id="jotSelector" class="col-xs-2"> | |
| <div id="jotButtons" class="btn-group-vertical center-block"> | |
| $forall (jotId, desc) <- jotButtons | |
| <button type="button" class="btn btn-default" onclick=displayJot(#{show jotId})> | |
| #{desc} | |
| <div id="jotViewer" class="col-xs-5"> | |
| <div id="jotAction" class="col-xs-5"> |
| open Core_kernel.Std | |
| (* Make a persistent graph where: | |
| A -> B | |
| B -> C | |
| C -> B *) | |
| module G = Graph.Persistent.Digraph.ConcreteBidirectional(String) | |
| let g = List.fold [("A", "B"); ("B", "C"); ("C", "B")] ~f:(fun g (x, y) -> | |
| G.add_edge g x y) ~init:G.empty;; |