Rob Rix
|
83dd3d5621
|
Merge branch 'master' into interpreter-decomposition
|
2017-02-27 15:22:38 -05:00 |
|
Timothy Clem
|
0afd447ba8
|
Merge pull request #1028 from github/semantic-diff-specs
Add basic Semantic diff specs and 🔥 the integration-tests and generate-test-cases
|
2017-02-27 12:21:56 -08:00 |
|
Timothy Clem
|
a9206ddec4
|
Add a post-receive hook to pack example repos
|
2017-02-27 12:15:44 -08:00 |
|
Timothy Clem
|
763ab482cc
|
🔥 the integration-tests and generate-test-cases
|
2017-02-27 08:50:54 -08:00 |
|
Timothy Clem
|
9d28028fc6
|
Remove unordered-containers, swap to hiding for hspec import
|
2017-02-27 08:35:45 -08:00 |
|
Timothy Clem
|
2722cc8b67
|
Fill in sad path test cases
|
2017-02-27 08:31:27 -08:00 |
|
Timothy Clem
|
9e7f719b00
|
Test if there are no paths, one more pending error case
|
2017-02-27 08:00:11 -08:00 |
|
Timothy Clem
|
1b68373240
|
Clean up imports
|
2017-02-24 17:07:36 -08:00 |
|
Timothy Clem
|
54029595b0
|
Use new example repository for integration testing
|
2017-02-24 17:02:19 -08:00 |
|
Timothy Clem
|
980b6c95bc
|
First pass at full stack specs
|
2017-02-24 16:46:22 -08:00 |
|
Rob Rix
|
4992299dd8
|
Define run by iteration.
|
2017-02-24 13:42:53 -05:00 |
|
Rob Rix
|
209e7c0896
|
Write Then infix.
|
2017-02-24 13:34:08 -05:00 |
|
Rob Rix
|
2f73758dfe
|
Define Algorithm as the Freer monad of AlgorithmF.
|
2017-02-24 13:28:44 -05:00 |
|
Rob Rix
|
edc09e4797
|
Correct the channel types fixture.
|
2017-02-24 12:00:12 -05:00 |
|
Rob Rix
|
0510e116f1
|
Merge remote-tracking branch 'origin/master' into interpreter-decomposition
|
2017-02-24 11:57:08 -05:00 |
|
Rob Rix
|
4b04e7f2eb
|
Fix up some go fixtures.
|
2017-02-24 11:51:37 -05:00 |
|
Rob Rix
|
1577dd2d0d
|
Merge pull request #1027 from github/example-generator
Script to generate example expected output
|
2017-02-24 11:50:51 -05:00 |
|
Timothy Clem
|
035dd01171
|
Sorting for no good reason
|
2017-02-24 08:44:50 -08:00 |
|
Timothy Clem
|
cc92808789
|
Give the Go expected output some newlines
|
2017-02-24 08:44:03 -08:00 |
|
Rob Rix
|
8b5dfbee42
|
Merge branch 'master' into interpreter-decomposition
|
2017-02-24 11:43:48 -05:00 |
|
Timothy Clem
|
7e0ddeac5e
|
Merge remote-tracking branch 'origin/master' into example-generator
|
2017-02-24 08:43:33 -08:00 |
|
Rob Rix
|
f41c43fba9
|
Merge pull request #1023 from github/transition-go-tests
Transition Go tests
|
2017-02-24 11:42:50 -05:00 |
|
Rob Rix
|
0d28bde257
|
…and the rest.
|
2017-02-24 11:42:11 -05:00 |
|
Timothy Clem
|
517876d7e6
|
Make sure javascript example expected outputs end with newline
|
2017-02-24 08:39:01 -08:00 |
|
Timothy Clem
|
6164c4c766
|
Update all ruby example expected outputs to end with newline
|
2017-02-24 08:37:35 -08:00 |
|
Timothy Clem
|
a900e48b44
|
New script for generating examples
|
2017-02-24 08:36:18 -08:00 |
|
Rob Rix
|
e5555ea133
|
Correct boolean operator tests.
|
2017-02-24 10:53:28 -05:00 |
|
Rob Rix
|
76d76c928c
|
Correct the Ruby rescue modifier fixtures.
|
2017-02-24 10:49:41 -05:00 |
|
Rob Rix
|
bd7306af4a
|
Merge remote-tracking branch 'origin/master' into interpreter-decomposition
|
2017-02-24 10:21:37 -05:00 |
|
Rob Rix
|
04a0f8b913
|
Export the algorithm-running functions.
|
2017-02-24 10:00:21 -05:00 |
|
Rob Rix
|
0f86062a03
|
Don’t return the steps in Either.
|
2017-02-24 09:59:29 -05:00 |
|
Rob Rix
|
39c49184d3
|
Define a function to return the steps taken during the evaluation of an algorithm.
|
2017-02-24 09:58:45 -05:00 |
|
Rob Rix
|
877f8a4171
|
📝 run, runStep.
|
2017-02-24 09:54:37 -05:00 |
|
Rob Rix
|
85c4364dfb
|
Define maybeLinearly in terms of Algorithm constructors.
|
2017-02-24 09:48:16 -05:00 |
|
Rob Rix
|
60c4f9a4a3
|
Tighten up the type signature of algorithmWithTerms.
|
2017-02-24 09:45:43 -05:00 |
|
Rob Rix
|
31e566386f
|
Move the functions around.
|
2017-02-24 09:35:53 -05:00 |
|
Rob Rix
|
df0019708e
|
🔥 runAlgorithm.
|
2017-02-24 09:27:34 -05:00 |
|
Rob Rix
|
8798bbfe77
|
🔥 diffComparableTerms.
|
2017-02-24 09:27:26 -05:00 |
|
Rob Rix
|
6210711a23
|
Perform diffs using the decompositional interpreter.
|
2017-02-24 09:23:03 -05:00 |
|
Rob Rix
|
04ee76ebcb
|
Define big-step interpretation in terms of small-step interpretation.
|
2017-02-24 09:15:29 -05:00 |
|
Rob Rix
|
cefd594191
|
Define small-step interpretation in terms of decompose.
|
2017-02-24 09:12:37 -05:00 |
|
Rob Rix
|
845ae84d9e
|
Use the SyntaxDiff/SyntaxTerm type synonyms.
|
2017-02-24 09:12:27 -05:00 |
|
Josh Vera
|
3f34257e6a
|
Merge branch 'master' into transition-go-tests
|
2017-02-23 18:50:12 -05:00 |
|
Josh Vera
|
9184275393
|
Merge pull request #1024 from github/transition-javascript-tests
Transition JavaScript tests
|
2017-02-23 18:49:42 -05:00 |
|
Rob Rix
|
ef76256755
|
Construct pairwise diffs via algorithmWithTerms.
|
2017-02-23 16:54:32 -05:00 |
|
Rob Rix
|
5223c2c59f
|
Specialize decompose to Syntax.
|
2017-02-23 16:54:08 -05:00 |
|
Rob Rix
|
fe6d54ae04
|
Stub in handling of the Diff case.
|
2017-02-23 16:48:38 -05:00 |
|
Rob Rix
|
975c310e97
|
Inline the definition of annotate.
|
2017-02-23 16:42:41 -05:00 |
|
Rob Rix
|
9a42405112
|
Recur correctly for Diff algorithms.
|
2017-02-23 16:38:26 -05:00 |
|
Rob Rix
|
ae4f8da722
|
🔥 the truly constant-time approximation.
|
2017-02-23 16:36:36 -05:00 |
|