2007-10-08 |
Speaker: Juan Pedro Villa-Isaza
Talk title: Regular Expressions Using Haskell Abstract: Regular expressions are a way to describe text through pattern matching. You might want to use regular expressions to validate data, to pull pieces of text out of larger blocks, or to substitute new text for old text. Today, regular expressions are included in most programming languages as well as many scripting languages, editors, applications, databases, and command-line tools. In Regular Expressions Using Haskell, we show how to use regular expressions with the Haskell programming language, and we give an introduction to the standard library that implements regexps in Haskell, the Text.Regex.Posix library.
Slides: [ pdf ] |
2007-07-17 |
Speaker: Sergio Monsalve
Talk title: ACM-ICPC (International Collegiate Programming Contest) problems, approximations and solutions
Abstract: The ACM-ICPC (International Collegiate Programming Contest) is a big oportunity that College students have to demostrate their programming, problem-solving and team working skills. The solutions can be implemented in C, C , Pascal or Java; and these are tested by a robot Judge that operates with basic IO. For some problems of the ICPC we will be presenting some posible solutions in C and Java. |
2007-07-03 |
Speaker: Federico Builes
Talk title: Web Programming with Haskell
Abstract: We present an overview of the current state of the art in the web applications field, using Haskell as an implementation language. There have been many different approaches to this problem, from shared memory cloud-like systems to the usual database-backed applications, all of them built on top of the properties of a strictly functional language as Haskell. We review the most updated developments, their problems and how the future looks in this particular area.
Slides: [ url ] |
2007-06-14 |
Speaker: Luz Alejandra Parra
Talk title: DNA Computing
Abstract: The aim of the exposition is to make an introduction of matters related with the DNA, begin from the basics of biochemistry language and computation theory. DNA computing is a discipline that aims at harnessing individual molecules at the nanoscopic level for computational purposes. I also will speak about the operation on DNA molecules, and the exposition of the famous Adleman's experiment. |
2007-05-31 |
Speaker: Diego Echeverry-Saldarriaga
Talk title: Multi-Objective Optimization for designing Multicast Overlay Networks
Abstract: Overlay Networks have proven to be a possible solution to content distribution, content sharing and Multicast communications. In the case of Multicast Overlay Networks, a balance is needed between the intrinsically conflictive variables (such as Delay and bandwidth) that define the Quality of Service (QoS) of specific applications. One way to achieve this is by optimizing the way the Overlay network is calculated. Our work is the evaluation of different multi-objective evolutionary algorithms (NSGAII, SPEA2) for constructing Overlay networks against naive approaches such as Brute Force or Random Search. |
2007-05-15 |
Speaker: Gloria M. Rúa
Talk title: Doxastic Logics SCR-nT4, SCR-nT5, and SCR-nD45
Abstract: We present as extensions of the classical propositional calculus, the hierarchy of deductive systems SCR-n,(with n greater 1). SCR-n is the system of beliefs for agents of type n. The systems are characterized with Kripke-style semantics, in which, the length of the possible world chains is restricted on the type of agent. Moreover, the depth of a model corresponds to the maxim length of the possible world chains that they appear in the model, being that the models of depth n characterize deductive system SCR-(n 1). The SCR-n systems extend, using the theory of the correspondence, to the hierarchies of systems of doxastic logic SCR-nT4, SCR-nT5, and SCR-nD45. Notion of belief is formal in sense of justified knowledge, and conviction, respectively, giving like result systems of doxastic and epistemic logics. They have problem of logical omniscient partially controlled. |
2007-04-17 |
Speaker: Manuel Sierra
Talk title: Ilustración de los operadores de afirmación y negación alternas
Abstract: En el sistema deductivo LB, los operadores de afirmación y negación alterna generalizan los operadores de afirmación y negación de la lógica clásica. En esta presentación, siguiendo la definición de verdad presentada por Aristóteles, se ilustra el funcionamiento de estos operadores, al realizar el análisis de la paradoja conocida con el nombre de los cofres de porcia: …… La prueba que inventó parecía de lo más simple: tenía sólo dos cofres, uno de plata y otro de oro, y en uno de ellos se ocultaba su retrato. Las tapas de los cofres tenían las siguientes inscripciones. Cofre de oro: el retrato no está aquí. Cofre de plata: uno y nada más que uno de estos enunciados es verdad. ¿En qué cofre cofre se encuentra el retrato? Pues bien, el pretendiente razonó así: sí la inscripción del cofre de plata es verdad, se da el caso de que uno y sólo uno de los dos enunciados es verdadero, lo que quiere decir que el enunciado del cofre de oro debe de ser falso. Por otro lado, supongamos que el enunciado del cofre de plata es falso, entonces no se dará el caso de que uno y sólo uno de los dos enunciados sea verdad sino que ambos enunciados podrían ser o ambos verdaderos o ambos falsos, pero los dos no pueden ser verdad (ya que asumimos que el segundo es falso), de aquí que ambos sean falsos. Así pues, de nuevo tenemos que el enunciado del cofre de oro es falso, lo que quiere decir que lo mismo que sea verdadero que falso el enunciado del cofre de plata, el del cofre de oro tiene que ser falso, de manera que el retrato tiene que estar en el cofre de oro. Tras razonar así, el pretendiente exclamó triunfante: «El retrato tiene que estar en el cofre de oro», y lo abrió para comprobar horrorizado que estaba vacío. Sin poder comprenderlo insistía en que Porcia le había engañado. Pero Porcia abrió el cofre de plata, el retrato estaba dentro. Bien, ¿dónde se había equivocado el pretendiente en su razonamiento? |
2007-03-27 |
Speaker: Raquel Anaya
Talk title: Consideraciones para integrar los métodos formales como práctica en el desarrollo de software
Abstract: Se hara una presentación general del estado actual del desarrollo de software con respecto al uso de lenguajes y formalismos y se plantearan algunas alternativas de acercamiento de los métodos formales de tal manera que fortalezcan la practica del desarrollo de software no solo a nivel academico sino, principalmente, a nivel empresarial. Se contara con la presencia de desarrolladores de la industria quienes tambien nos daran su percepcion acerca del tema.
Slides: [ pdf ] |
2007-03-13 |
Speaker: Francisco José Correa-Zabala
Talk title: Integrated framework for the debugging and correction of functional logic programs
Abstract: We present a generic scheme for the declarative debugging of functional logic programs. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination, in a single framework, of a semantics-based diagnoser which identifies those parts of the code which contain errors, together with an inductive learner which, once the bug has been located in the program, tries to repair it. |
2007-02-27 |
Speaker: Andrés Sicard-Ramírez
Talk title: Programming languages meets program verification: The Chalmers University's approach
Abstract: We will give an overview of the CoVer project (Combining VerificationMethods in Software Development) at Chalmers University, Sweden. The goal of this project is to provide an environment for Haskell programming which provides access to tools for automatic and interactive correctness proofs as well as to tools for testing.Moreover, we will show a short demo of two tools developed aroundCoVer project: Agda, a proof assistant using dependent type theory,and QuickCheck, a property based random testing tool for Haskell.
Slides: [ pdf ] |