1995 |
15 | | György E. Révész:
Categorical Combinations with Explicit Products.
Fundam. Inform. 22(1/2): 153-166 (1995) |
1992 |
14 | | György E. Révész:
A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem.
Theor. Comput. Sci. 93(1): 75-89 (1992) |
1991 |
13 | | György E. Révész:
On Translating Ordinary Mathematical Notation.
Structured Programming 12(3): 115-122 (1991) |
1990 |
12 | | György E. Révész:
Parallel Graph-Reduction with a Shared Memory Multiprocessor System.
ICCL 1990: 33-38 |
1989 |
11 | EE | Brent Hailpern,
Tien Huynh,
György E. Révész:
Comparing Two Functional Programming Systems.
IEEE Trans. Software Eng. 15(5): 532-542 (1989) |
1987 |
10 | | György E. Révész:
Rule-Based Semantics for an Extended Lambda-Calculus.
MFPS 1987: 43-56 |
1985 |
9 | | György E. Révész:
Axioms for the Theory of Lambda-Conversion.
SIAM J. Comput. 14(2): 373-382 (1985) |
8 | | György E. Révész:
A Note on Macro Generation.
Softw., Pract. Exper. 15(5): 423-426 (1985) |
1984 |
7 | | György E. Révész:
An Extension of Lambda-Calculus for Functional Programming.
J. Log. Program. 1(3): 241-251 (1984) |
1977 |
6 | | György E. Révész:
Multicontrol Turing machines.
Acta Cybern. 3: 173-177 (1977) |
5 | | György E. Révész:
Algebraic Properties of Derivation Words.
J. Comput. Syst. Sci. 15(2): 232-240 (1977) |
1974 |
4 | | György E. Révész:
Comment on the Paper "Error Detection in Formal Languages".
J. Comput. Syst. Sci. 8(2): 238-242 (1974) |
1972 |
3 | | György E. Révész:
Dual pushdown automata and contex sensitive grammars.
Acta Cybern. 1: 147-151 (1972) |
1971 |
2 | | György E. Révész:
Unilateral Context Sensitive Grammars and Left-to-Right Parsing.
J. Comput. Syst. Sci. 5(4): 337-352 (1971) |
1968 |
1 | | György E. Révész:
An Efficient Syntactic Analyser of Certain Formal Languages.
Mathematical Systems Theory 2(2): 147-158 (1968) |