#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2002

2017

- This year (7)
- Last 5 years (27)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Geoffrey Madalinski, Emmanuel Godat, +7 authors Christophe Junot
- Analytical chemistry
- 2008

We report the direct introduction of biological samples into a high-resolution mass spectrometer, the LTQ-Orbitrap, as a fast tool for metabolomic studies. A proof of concept study was performed on yeast cell extracts that were introduced into the mass spectrometer by using flow injection analysis, with an acquisition time of 3 min. Typical mass spectraâ€¦ (More)

- Sandra Alves, Maribel FernÃ¡ndez, MÃ¡rio Florido, Ian Mackie
- Theor. Comput. Sci.
- 2010

- Sandra Alves, Maribel FernÃ¡ndez, MÃ¡rio Florido, Ian Mackie
- PPDP
- 2011

We show that the full PCF language can be encoded in <i>L</i>_rec, a syntactically linear λ-calculus extended with numbers, pairs, and an unbounded recursor that preserves the syntactic linearity of the calculus. We give call-by-name and call-by-value evaluation strategies and discuss implementation techniques for <i>L</i>_rec, exploiting its linearity.

The linear lambda calculus is very weak in terms of expressive power: in particular, all functions terminate in linear time. In this paper we consider a simple extension with Booleans, natural numbers and a linear iterator. We show properties of this linear version of GÃ¶delâ€™s System T and study the class of functions that can be represented. Surprisingly,â€¦ (More)

- Sandra Alves, MÃ¡rio Florido
- Electr. Notes Theor. Comput. Sci.
- 2002

- Sandra Alves, Maribel FernÃ¡ndez, MÃ¡rio Florido, Ian Mackie
- Rewriting, Computation and Proof
- 2007

With the recent trend of analysing the process of computation through the linear logic looking glass, it is well understood that the ability to copy and erase data is essential in order to obtain a Turingcomplete computation model. However, erasing and copying do not need to be explicitly included in Turing-complete computation models: in this paper we showâ€¦ (More)

- Sandra Alves, Maribel FernÃ¡ndez, MÃ¡rio Florido, Ian Mackie
- Electr. Notes Theor. Comput. Sci.
- 2007

Closed reduction strategies in the Î»-calculus restrict the reduction rules: the idea is that reductions can only take place when certain terms are closed (i.e. do not contain free variables). This has lead to various applications, such as an Î±-conversion free calculus of explicit substitutions, and an efficient abstract machine. The main contribution ofâ€¦ (More)

- Sandra Alves, Maribel FernÃ¡ndez, Ian Mackie
- TERMGRAPH
- 2011

We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic). This graphical calculus of proofs inherits good features from each, but is not constrained by them. By the Curry-Howard isomorphism, the representation applies equally to the lambdaâ€¦ (More)

- Sandra Alves, MÃ¡rio Florido
- Theor. Comput. Sci.
- 2005

We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambda-terms keeping their good properties of strong normalization, non-duplicating reductions and typability in polynomial time. The advantage of this class over the linear lambda-calculus is the possibility of transforming general terms intoâ€¦ (More)

- Sandra Alves, Maribel FernÃ¡ndez, MÃ¡rio Florido, Ian Mackie
- ArXiv
- 2010

We define two extensions of the typed linear lambda-calculus that yield minimal Turingcomplete systems. The extensions are based on unbounded recursion in one case, and bounded recursion with minimisation in the other. We show that both approaches are compatible with linearity and typeability constraints. Both extensions of the typed linear lambda-calculusâ€¦ (More)