Partial molecular characterization of the Nile tilapia (Oreochromis niloticus) alpha-cardiac muscle actin gene and its relationship to actin isoforms of other fish species

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Resoluciones de otros órganos de la Organización de las Naciones Unidas que traen consecuencias para el Comité de Desarrollo y Cooperación del Caribe = Resolutions of other United Nations bodies with implications for the Caribbean Development and Co-operation Committee (CDCC) = Résolutions d'autres organismes de l'Organisation des Nations Unies ayant des incidences sur le Comité de Développement et de Coopération des Caraïbes (CDCC)

Se refiere a resoluciones que emanan de otros organos de la ONU, incluso la CEPAL, el Consejo Economico y Social y la Asamblea General. El documento pretende llamar a la atencion del Comite las acciones de seguimiento tomadas acerca de ciertos asuntos que el Comite ha considerado en sesiones anteriores y que tengan alguna implicacion directa o indirecta para el CDCC o que sean de interes para el trabajo de la Secretaria.

Hispanic poverty from the current population survey and poverty of other self-identified ethnic groups from census information

Includes bibliography

Características da interação no contexto de aprendizagem in-tandem

Pós-graduação em Estudos Linguísticos - IBILCE

A formação inicial de professoras de línguas para/em contexto mediado pelo computador (teletandem): um diálogo entre crenças, discurso e reflexão profissional

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Relações de poder em parcerias de teletandem

Pós-graduação em Estudos Linguísticos - IBILCE

Conflitos no diálogo eu-outro em contexto de Tandem português e espanhol

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Theoretical and implementation aspects in the mechanization of the metatheory of programming languages

Interactive theorem provers are tools designed for the certification of formal proofs developed by means of man-machine collaboration. Formal proofs obtained in this way cover a large variety of logical theories, ranging from the branches of mainstream mathematics, to the field of software verification. The border between these two worlds is marked by results in theoretical computer science and proofs related to the metatheory of programming languages. This last field, which is an obvious application of interactive theorem proving, poses nonetheless a serious challenge to the users of such tools, due both to the particularly structured way in which these proofs are constructed, and to difficulties related to the management of notions typical of programming languages like variable binding. This thesis is composed of two parts, discussing our experience in the development of the Matita interactive theorem prover and its use in the mechanization of the metatheory of programming languages. More specifically, part I covers: - the results of our effort in providing a better framework for the development of tactics for Matita, in order to make their implementation and debugging easier, also resulting in a much clearer code; - a discussion of the implementation of two tactics, providing infrastructure for the unification of constructor forms and the inversion of inductive predicates; we point out interactions between induction and inversion and provide an advancement over the state of the art. In the second part of the thesis, we focus on aspects related to the formalization of programming languages. We describe two works of ours: - a discussion of basic issues we encountered in our formalizations of part 1A of the Poplmark challenge, where we apply the extended inversion principles we implemented for Matita; - a formalization of an algebraic logical framework, posing more complex challenges, including multiple binding and a form of hereditary substitution; this work adopts, for the encoding of binding, an extension of Masahiko Sato's canonical locally named representation we designed during our visit to the Laboratory for Foundations of Computer Science at the University of Edinburgh, under the supervision of Randy Pollack.