Search Results - "Compilation. Keywords Functional Logic Programming Languages"

Compiling a Functional Logic Language: The Fair Scheme?

Authors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Contributors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Source: http://web.cecs.pdx.edu/%7Eantoy/homepage/publications/lopstr13/long.pdf.

Subject Terms: Categories and Subject Descriptors D.3.3 [Programming Languages, Language Con- structs and Features — Control structures, D.3.4 [Programming Languages, Proces- sors — Compilers, F.4.2 [Mathematical Logic and Formal Languages, Grammars and Other Rewriting Systems —, G.2.2 [Discrete Mathematics, Graph Theory — Graph algorithms, F.1.2 [Computation by Abstract Devices, Modes of Computation — Alternation and nondeterminism, General Terms Languages, Non-Determinism, Graph, Rewriting, Compilation. Keywords Functional Logic Programming Languages, Graph Rewriting Systems, Compiler Construction

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.1466; http://web.cecs.pdx.edu/%7Eantoy/homepage/publications/lopstr13/long.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.699.1466
http://web.cecs.pdx.edu/%7Eantoy/homepage/publications/lopstr13/long.pdf

Compiling a Functional Logic Language: The Fair Scheme

Authors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Contributors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Source: http://web.cecs.pdx.edu/~antoy/homepage/publications/lopstr13/long.pdf.

Subject Terms: Categories and Subject Descriptors D.3.3 [Programming Languages, Language Constructs and Features — Control structures, D.3.4 [Programming Languages, Processors — Compilers, F.4.2 [Mathematical Logic and Formal Languages, Grammars and Other Rewriting Systems —, G.2.2 [Discrete Mathematics, Graph Theory — Graph algorithms, F.1.2 [Computation by Abstract Devices, Modes of Computation — Alternation and nondeterminism, General Terms Languages, Non-Determinism, Graph, Rewriting, Compilation. Keywords Functional Logic Programming Languages, Graph Rewriting Systems, Compiler Construction

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.5670; http://web.cecs.pdx.edu/~antoy/homepage/publications/lopstr13/long.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.5670
http://web.cecs.pdx.edu/~antoy/homepage/publications/lopstr13/long.pdf

Are Needed Redexes Really Needed?

Authors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Contributors: Sergio Antoy Andy Jost The Pennsylvania State University CiteSeerX Archives

Source: http://web.cecs.pdx.edu/~antoy/homepage/publications/ppdp13/paper.pdf.

Subject Terms: Categories and Subject Descriptors D.3.3 [Programming Languages, Language Constructs and Features—Control structures, D.3.4 [Programming Languages, Processors—Compilers, F.4.2 [Mathematical Logic and Formal Languages, Grammars and Other Rewriting Systems, G.2.2 [Discrete Mathematics, Graph Theory—Graph algorithms General Terms Languages, Graph, Rewriting, Compilation. Keywords Functional Logic Programming Languages, Graph Rewriting Systems, Call-by-Need, Compiler Construction

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.7963; http://web.cecs.pdx.edu/~antoy/homepage/publications/ppdp13/paper.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.7963
http://web.cecs.pdx.edu/~antoy/homepage/publications/ppdp13/paper.pdf