1
1
mirror of https://github.com/github/semantic.git synced 2024-12-23 06:41:45 +03:00
Commit Graph

263 Commits

Author SHA1 Message Date
joshvera
7395e88ab0 Remove Data.RandomWalkSimilarity 2017-04-24 15:53:11 -04:00
joshvera
2cff2caf68 Use the RWS effect 2017-04-07 17:59:45 -04:00
joshvera
81e178fc61 Keep track of clauses before a Method identifier 2017-03-30 18:00:13 -04:00
joshvera
b5f9938279 Remove ty from Method and throw every part of a call signature into a list 2017-03-29 16:24:54 -04:00
joshvera
cdbd260b0f Remove type from Function and unpack call signatures 2017-03-29 12:36:05 -04:00
joshvera
461b1c665b Merge remote-tracking branch 'origin/master' into typescript 2017-03-29 10:17:53 -04:00
joshvera
ad68312273 Allow type parameters in function and method calls 2017-03-28 18:55:57 -04:00
joshvera
60b47317c1 Relax class heritage structure in Syntax.Class 2017-03-28 18:16:04 -04:00
Rob Rix
a8410e8829 🔥 various uses of LambdaCase. 2017-03-28 15:32:45 -04: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
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
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
Rob Rix
e74b4e9e15 Approximate the edit distance similarly to how we did before. 2017-02-23 16:27:24 -05:00
Rob Rix
18cd862dc3 Parameterize rws by the approximate edit distance. 2017-02-23 16:13:42 -05:00
Rob Rix
ef2715f4f0 RWS’s comparison function takes These. 2017-02-23 14:17:52 -05:00
Rob Rix
22236ebd7e Give RWS separate functions for comparisons and determining whether a comparison should be made. 2017-02-23 14:13:13 -05:00
Rob Rix
36ae3053b4 Use the diffThese combinator to recur in linear decomposition. 2017-02-23 14:12:39 -05:00
Rob Rix
c6461ce94c Extract the comparability test. 2017-02-23 14:05:25 -05:00
Rob Rix
5a63ceb864 Linear algorithms recur linearly. 2017-02-23 12:12:32 -05:00
Rob Rix
6356967923 📝 decompose’s signature. 2017-02-23 12:11:42 -05:00
Rob Rix
06f6192a43 Reformat decompose’s type signature. 2017-02-23 12:10:35 -05:00
Rob Rix
e94020d68c Stub in decomposition of RWS. 2017-02-23 11:04:59 -05:00
Rob Rix
6dcfff4716 Loosen the Eq constraint in RWS to an Eq1 constraint. 2017-02-23 11:03:25 -05:00
Rob Rix
b48a15e277 Specialize decompose to record annotations. 2017-02-21 15:41:07 -05:00
Rob Rix
e7cc5a9c6e Merge branch '🔥-cost' into interpreter-decomposition 2017-02-21 15:35:41 -05:00
Rob Rix
fe326bcf03 🔥 the comparability parameter to diffTerms. 2017-02-21 15:23:30 -05:00
Rob Rix
c4f37454d6 🔥 the construct parameter to diffTerms. 2017-02-21 15:17:35 -05:00
Rob Rix
01c47fa0c1 🔥 the computation of costs. 2017-02-21 14:34:24 -05:00
Rob Rix
c966257fc8 Decompose deletions, insertions, and replacements. 2017-02-21 13:55:06 -05:00
Rob Rix
3b71c510e7 Define a function decomposing an algorithm into its next steps. 2017-02-21 13:40:59 -05:00
Rob Rix
9cf6b262eb Add Delete, Insert, and Replace algorithms. 2017-02-21 11:40:13 -05:00