A Functional Perspective on Machine Learning via Programmable Induction and Abduction

Cheung, Steven W.; Darvariu, Victor; Ghica, Dan R.; Muroya, Koko; Rowe, Reuben N. S.

doi:10.1007/978-3-319-90686-7_6

Search citation statements

Order By: Relevance

Paper Sections

Select...

Conclusion and Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

2021

Publication Types

Select...

Other2

Article1

Relationship

Self Cite1

Independent2

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the operational semantics does not involve ine cient (worse than linear) operations, indicating a good potential for implementability. Reaching a language comparable in sophistication and e ciency with TF is a long path, but we are making the rst steps in that direction [3]. e advantages of using a stand-alone language, especially when there is evidence that it has a reasonably well behaved semantics, are signi cant, as EDSLs su er from well known pitfalls [18].…”

Section: Conclusion and Related Workmentioning

confidence: 99%

The Geometry of Computation-Graph Abstraction

Muroya

Cheung

Ghica

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

Section: Conclusion and Related Workmentioning

confidence: 99%

The Geometry of Computation-Graph Abstraction

Muroya

Cheung

Ghica

2018

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science

Self Cite

View full text Add to dashboard Cite

Transparent Synchronous Dataflow

Cheung¹,

Ghica²,

Muroya³

2021

Programming

View full text Add to dashboard Cite

The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter

Muroya¹,

Ghica²

2019

Logical Methods in Computer Science ; Volume 15

View full text Add to dashboard Cite

In implementing evaluation strategies of the lambda-calculus, both correctness and efficiency of implementation are valid concerns. While the notion of correctness is determined by the evaluation strategy, regarding efficiency there is a larger design space that can be explored, in particular the trade-off between space versus time efficiency. Aiming at a unified framework that would enable the study of this trade-off, we introduce an abstract machine, inspired by Girard's Geometry of Interaction (GoI), a machine combining token passing and graph rewriting. We show soundness and completeness of our abstract machine, called the Dynamic GoI Machine (DGoIM), with respect to three evaluations: call-by-need, left-to-right call-by-value, and right-to-left call-by-value. Analysing time cost of its execution classifies the machine as "efficient" in Accattoli's taxonomy of abstract machines.

show abstract

A Functional Perspective on Machine Learning via Programmable Induction and Abduction

Abstract: The version in the Kent Academic Repository may differ from the final published version. Users are advised to check http://kar.kent.ac.uk for the status of the paper. Users should always cite the published version of record.

Cited by 3 publications

References 21 publications

The Geometry of Computation-Graph Abstraction

The Geometry of Computation-Graph Abstraction

Transparent Synchronous Dataflow

The Dynamic Geometry of Interaction Machine: A Token-Guided Graph Rewriter

Contact Info

Product

Resources

About