In mathematics and computer science, currying is the technique of translating the evaluation of a function that takes multiple arguments (or a tupleâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2007

2007

- Temur Kutsia, Jordi Levy, Mateu Villaret
- RTA
- 2007

Sequence variables play an interesting role in unification and matching when dealing with terms in an unranked signatureâ€¦Â (More)

Is this relevant?

2004

2004

- Yuichi Komori
- 2004

In [8] (1920), Lukasiewicz introduced a 3-valued propositional calculus with one designated truth-value and later in [9â€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Simon Marlow, Simon L. Peyton Jones
- ICFP
- 2004

Higher-order languages that encourage currying are implemented using one of two basic evaluation models: push/enter or eval/applyâ€¦Â (More)

Is this relevant?

2002

2002

- Jordi Levy, Mateu Villaret
- RTA
- 2002

The Curry form of a term, like f(a, b), allows us to write it, using just a single binary function symbol, as @(@(f, a), bâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- C.-H. Luke Ong, Charles A. Stewart
- POPL
- 1997

We introduce the type theory Â¿Âµv, a call-by-value variant of Parigot's Â¿Âµ-calculus, as a Curry-Howard representation theory ofâ€¦Â (More)

Is this relevant?

1996

1996

- Norman Ramsey
- PLDI
- 1996

Relocation adjusts machine instructions to account for changes in the locations of the instructions themselves or of externalâ€¦Â (More)

Is this relevant?

1996

1996

- Hideki Tsuiki
- 1996

We present a calculus based on the view that it should be possible to de ne a subclass method by specifying only the way in whichâ€¦Â (More)

Is this relevant?

1996

1996

- Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries
- J. Symb. Comput.
- 1996

Currying is a transformation of term rewrite systems which may contain symbols of arbitrary arity into systems which contain onlyâ€¦Â (More)

Is this relevant?

1995

1995

- Stefan Kahrs
- J. Symb. Comput.
- 1995

Reduction Systems Definition An Abstract Reduction System short ARS consists of a set A and a sequence i of binary relations on Aâ€¦Â (More)

Is this relevant?

1984

1984

- Reinhard Wilhelm
- POPL
- 1984

Inverse currying transformation of an attribute grammar moves a context condition to places in the grammar where the violation ofâ€¦Â (More)

Is this relevant?