This website requires JavaScript.
Explore
Help
Sign In
suzanne.soy
/
phc-graph
Watch
1
Star
0
Fork
0
You've already forked phc-graph
Code
Issues
24
Pull Requests
Actions
Packages
Projects
Releases
Wiki
Activity
Labels
Milestones
New Issue
24 Open
3 Closed
Label
Show archived labels
Use
alt
+
click/enter
to exclude labels
All labels
No label
bug
current task
duplicate
enhancement
help wanted
in progress
invalid
later
question
ready
wontfix
Milestone
All milestones
No milestones
Open milestones
Row polymorphism
Graph low-level
Cleanup & presentation
Graph invariants
Write memoir
Formalise type system extensions
Benchmark: translate all Nanopass examples
Project
All projects
No project
Author
All authors
Assignee
All assignees
No assignee
suzanne.soy
Sort
Newest
Oldest
Recently updated
Least recently updated
Most commented
Least commented
Nearest due date
Farthest due date
24 Open
3 Closed
Close
Label
Clear labels
bug
current task
duplicate
enhancement
help wanted
in progress
invalid
later
question
ready
wontfix
Milestone
No milestone
Open milestones
Row polymorphism
Graph low-level
Cleanup & presentation
Graph invariants
Write memoir
Formalise type system extensions
Benchmark: translate all Nanopass examples
Projects
Clear projects
Assignee
Clear assignees
No assignee
suzanne.soy
Proof that well-typed programs with the extensions translate to well-typed programs in plain TR, with the same semantics #27
#33
opened
2021-10-04 19:46:49 +01:00
by jsmaniac
Formalise type system extensions
Write memoir #26
#32
opened
2021-10-04 19:44:21 +01:00
by jsmaniac
Write memoir
Formalise the semantics of typed-nanopass+graph programs (using redex?) #25
#31
opened
2021-10-04 19:43:49 +01:00
by jsmaniac
Formalise type system extensions
Formalise what well-typed means for typed-nanopass+graph means #24
#30
opened
2021-10-04 19:43:11 +01:00
by jsmaniac
Formalise type system extensions
Translate https://github.com/akeep/scheme-to-c #23
#29
opened
2021-10-04 19:40:38 +01:00
by jsmaniac
Benchmark: translate all Nanopass examples
Translate https://github.com/nanopass/nanopass-framework-scheme #22
#28
opened
2021-10-04 19:39:58 +01:00
by jsmaniac
Benchmark: translate all Nanopass examples
to infer the type for curry, check using identifier-binding if the id is imported, if so try to print its type using eval #21
later
#27
opened
2021-10-04 19:39:06 +01:00
by jsmaniac
Check for non-intersection of the union types in traversal.hl.rkt, using the non-intersection implementation from phc-adt. #20
later
#26
opened
2021-10-04 19:38:34 +01:00
by jsmaniac
Merge tagged-anytag-match into the regular match for tagged structures #19
later
#25
opened
2021-10-04 19:37:58 +01:00
by jsmaniac
Garbage collect graph #18
later
#24
opened
2021-10-04 19:35:54 +01:00
by jsmaniac
Drop MathJax, directly print Unicode or render via LaTeX (speed & licensing issues) #17
ready
#23
opened
2021-10-04 19:34:11 +01:00
by jsmaniac
Cleanup & presentation
Write "middle-dot" language extension #16
later
#22
opened
2021-10-04 19:31:23 +01:00
by jsmaniac
Relicensing #15
in progress
#21
opened
2021-10-04 19:30:33 +01:00
by jsmaniac
Cleanup & presentation
Combine the graph passes into a single macro #14
in progress
#20
opened
2021-10-04 19:29:44 +01:00
by jsmaniac
Graph low-level
Implement the third graph generation pass: replacing indices with promises #13
ready
#19
opened
2021-10-04 19:28:49 +01:00
by jsmaniac
Graph low-level
Implement the second graph generation pass: inline nodes #12
ready
#18
opened
2021-10-04 19:28:07 +01:00
by jsmaniac
Graph low-level
Implement the first graph generation pass, with a placeholder wrapping each mapping result #11
in progress
#17
opened
2021-10-04 19:27:11 +01:00
by jsmaniac
Graph low-level
Implement graph #10
ready
#16
opened
2021-10-04 19:26:08 +01:00
by jsmaniac
Graph low-level
Cleanup invariants-phantom.hl.rkt #9
ready
#15
opened
2021-10-04 19:25:26 +01:00
by jsmaniac
Graph invariants
Run-time checkers for invariants #8
ready
#14
opened
2021-10-04 19:24:43 +01:00
by jsmaniac
Graph invariants
First
Previous
1
2
Next
Last