| 2008 |
|---|
| 26 | EE | Hugo Conceição,
Luís Damas,
Michel Ferreira,
João Barros:
Large-scale simulation of V2V environments.
SAC 2008: 28-33 |
| 2007 |
|---|
| 25 | EE | Sabine Broda,
Luís Damas:
On Principal Types of BCK- lambda -Terms.
WoLLIC 2007: 120-130 |
| 2005 |
|---|
| 24 | EE | Sabine Broda,
Luís Damas:
On Long Normal Inhabitants of a Type.
J. Log. Comput. 15(3): 353-390 (2005) |
| 2004 |
|---|
| 23 | EE | Mário Florido,
Luís Damas:
Linearization of the lambda-calculus and its relation with intersection type systems.
J. Funct. Program. 14(5): 519-546 (2004) |
| 22 | EE | Sabine Broda,
Luís Damas,
Marcelo Finger,
Paulo Silva e Silva:
The decidability of a fragment of BB'IW-logic.
Theor. Comput. Sci. 318(3): 373-408 (2004) |
| 2003 |
|---|
| 21 | EE | Michel Ferreira,
Luís Damas:
WAM Local Analysis.
PADL 2003: 286-303 |
| 2002 |
|---|
| 20 | EE | Sabine Broda,
Luís Damas:
Studying provability in implicational intuitionistic logic the formula tree approach.
Electr. Notes Theor. Comput. Sci. 67: (2002) |
| 2001 |
|---|
| 19 | EE | Sabine Broda,
Luís Damas:
A Context-Free Grammar Representation for Normal Inhabitants of Types in TAlambda.
EPIA 2001: 321-334 |
| 18 | | Sabine Broda,
Luís Damas:
Counting a Type's (Principal) Inhabitants.
Fundam. Inform. 45(1-2): 33-51 (2001) |
| 2000 |
|---|
| 17 | EE | Sabine Broda,
Luís Damas:
On principal types of combinators.
Theor. Comput. Sci. 247(1-2): 277-290 (2000) |
| 1999 |
|---|
| 16 | EE | Michel Ferreira,
Luís Damas:
Multiple Specialization of WAM Code.
PADL 1999: 243-258 |
| 15 | EE | Sabine Broda,
Luís Damas:
Counting a Type's Principal Inhabitants.
TLCA 1999: 69-82 |
| 1997 |
|---|
| 14 | | Sabine Broda,
Luís Damas:
On Combinatory Complete Sets of Proper Combinators.
J. Funct. Program. 7(6): 593-612 (1997) |
| 13 | | Sabine Broda,
Luís Damas:
Compact Bracket Abstraction in Combinatory Logic.
J. Symb. Log. 62(3): 729-740 (1997) |
| 1995 |
|---|
| 12 | | Luís Damas,
Nelma Moreira:
Constraint Categorial Grammars.
EPIA 1995: 347-358 |
| 11 | | Sabine Broda,
Luís Damas:
A New Translation Algorithm from Lambda Calculus into Combinatory Logic.
EPIA 1995: 359-370 |
| 10 | EE | Luís Damas,
Nelma Moreira:
Constraint Categorial Grammars
CoRR abs/cmp-lg/9507001: (1995) |
| 1993 |
|---|
| 9 | | Miguel Filgueiras,
Luís Damas:
Progress in Artificial Intelligence, 6th Portuguese Conference on Artificial Intelligence, EPIA '93, Porto, Portugal, October 6-8, 1993, Proceedings
Springer 1993 |
| 8 | | Luís Damas,
Nelma Moreira,
Sabine Broda:
Resolution of Constraints in Algebras of Rational Trees.
EPIA 1993: 61-76 |
| 1992 |
|---|
| 7 | EE | Luís Damas,
Giovanni B. Varile:
On the Satisfiability of Complex Constraints.
COLING 1992: 108-112 |
| 1991 |
|---|
| 6 | | Miguel Filgueiras,
Luís Damas,
Nelma Moreira,
Ana Paula Tomás:
Natural Language Processing, EAIA '90, 2nd Advanced School in Artificial Intelligence, Guarda, Portugal, October 8-12, 1990, Proceedings
Springer 1991 |
| 5 | EE | Luís Damas,
Giovanni B. Varile,
Nelma Moreira:
The Formal and Processing Models of CLG.
EACL 1991: 173-178 |
| 4 | | José Paulo Leal,
Luís Damas,
Nelma Moreira:
An History Based Interface.
LPE 1991: 10-16 |
| 1990 |
|---|
| 3 | EE | Sergio Balari,
Giovanni B. Varile,
Luís Damas,
Nelma Moreira:
CLG(n): Constraint Logic Grammars.
COLING 1990: 7-12 |
| 1989 |
|---|
| 2 | | Luís Damas,
Giovanni B. Varile:
CLG: A Grammar Formalism Based on Constraint Reslution.
EPIA 1989: 175-186 |
| 1982 |
|---|
| 1 | | Luís Damas,
Robin Milner:
Principal Type-Schemes for Functional Programs.
POPL 1982: 207-212 |
