mailing-list for TeXmacs Users

[Lukasz Stafiniak <address@hidden>]

This is my take. I have anonymized the first half page. In case you take a look you can share your comments.

On Thu, Nov 14, 2013 at 10:37 AM, Massimiliano Gubinelli <address@hidden> wrote:

I do not know. I have my CV in TeXmacs but is pretty basic, without any fancy stuff.
But it would be a nice contribution to have a reasonable style file for CVs and maybe an skeleton document for newbies to use. Now that other fonts start to be supported we can produce very nice results.

Max





On 14 nov. 2013, at 09:44, Lukasz Stafiniak <address@hidden> wrote:

> Hello,
>
> Does someone have a Resume/CV style file in the works?
>
> Best,
> Łukasz

<TeXmacs|1.0.7.21>

<style|<tuple|generic|english>>

<\body>
  <very-large|<with|font-series|bold|<with|font-shape|small-caps|Jan
  Kowalski>>><next-line><hrule>

  <\with|par-mode|right>
    <small|<tabular|<tformat|<cwith|4|4|1|1|cell-halign|r>|<cwith|3|3|1|1|cell-halign|r>|<cwith|2|2|1|1|cell-halign|r>|<cwith|1|1|1|1|cell-halign|r>|<table|<row|<cell|Main
    Street 123/4>>|<row|<cell|12-345 Anytown, Poland>>|<row|<cell|+48
    123456789>>|<row|<cell|<hlink|<with|font-family|ss|address@hidden>|mailto:address@hidden>>>|<row|<cell|<hlink|<verbatim|http://uni.anytown.pl/~jankow>|http://ii.uni.wroc.pl/~lukstafi>>>>>>>
  </with>

  <tabular|<tformat|<cwith|10|10|1|1|cell-halign|r>|<cwith|12|12|3|3|cell-col-span|2>|<cwith|14|14|3|3|cell-col-span|2>|<cwith|15|15|3|3|cell-col-span|2>|<cwith|20|20|1|1|cell-halign|r>|<cwith|21|21|3|3|cell-col-span|2>|<cwith|1|1|3|3|cell-width|98mm>|<cwith|1|1|3|3|cell-hmode|exact>|<cwith|1|1|3|3|cell-hyphen|t>|<cwith|1|1|1|1|cell-hyphen|t>|<cwith|1|1|1|1|cell-width|12mm>|<cwith|1|1|1|1|cell-hmode|exact>|<cwith|6|6|4|4|cell-halign|r>|<cwith|7|7|3|3|cell-col-span|2>|<cwith|4|4|3|3|cell-col-span|2>|<cwith|3|3|3|3|cell-col-span|1>|<table|<row|<\cell>
    <strong|RESEARCH INTERESTS>
  </cell>|<cell|>|<\cell>
    <with|color|darker grey|Lorem ipsum dolor sit amet, consectetur
    adipiscing elit. Curabitur dapibus neque eget bibendum tempus. Praesent
    pellentesque venenatis laoreet. Duis at sem eget ipsum luctus vehicula.
    Class aptent taciti sociosqu ad litora torquent per conubia nostra, per
    inceptos himenaeos. Sed euismod felis nisl, at facilisis diam ultricies
    sed. Nullam nunc orci, sagittis a ornare in, aliquam non erat. Integer
    venenatis, ligula nec sodales dignissim, augue turpis iaculis mauris,
    eget suscipit est nisi sit amet tellus. Fusce consectetur malesuada
    lacus, vitae fringilla leo aliquet lobortis. Curabitur mauris nibh,
    aliquet a lacus vel, varius iaculis felis. Sed vestibulum scelerisque
    sapien, ut consequat elit bibendum quis.>
  </cell>|<cell|>>|<row|<cell|>|<cell|>|<cell|>|<cell|>>|<row|<cell|<strong|EDUCATION>>|<cell|>|<cell|<strong|PhD
  in Computer Science> -- University of Anytown<htab|5mm>>|<cell|<em|2005-2010>>>|<row|<cell|>|<cell|>|<cell|<small|Thesis:
  <with|font-family|ss|Curabitur rhoncus magna at ante consequat
  auctor>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|>|<cell|>>|<row|<cell|>|<cell|>|<cell|<strong|M.Sc.
  Mathematics> -- Anytown University of Technology>|<cell|<em|1999-2005>>>|<row|<cell|>|<cell|>|<cell|<small|Broad
  mathematical curriculum. Thesis: <with|font-family|ss|Aliquam erat
  volutpat>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|>|<cell|>>|<row|<cell|<strong|EXPERIENCE>>|<cell|>|<cell|>|<cell|>>|<row|<cell|<strong|Publications>>|<cell|>|<cell|<small|Š.
  Kaiser and Š. Stafiniak. <with|font-family|ss|Playing Structure Rewriting
  Games>.>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|<em|In Proceedings of
  AGI '10. Atlantis Press, 2010.>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|Š.
  Kaiser and Š. Stafiniak. <with|font-family|ss|First-Order Logic with
  Counting for General Game Playing>.>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|<em|In
  Proceedings of the 25th AAAI Conference,
  2011.>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|Š. Kaiser and Š.
  Stafiniak. <with|font-family|ss|Translating the Game Description Language
  to Toss>.>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|<em|In Proceedings
  of the 2nd International General Game Playing
  Workshop,>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|<em|GIGA'11,
  2011.>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|Š. Stafiniak.
  <with|font-family|ss|Joint Constraint Abduction
  Problems>.>>|<cell|>>|<row|<cell|>|<cell|>|<cell|<small|<em|In UNIF 2011 --
  The International Workshop on Unification.>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|>|<cell|>>|<row|<cell|<strong|Teaching>>|<cell|>|<cell|Lecturer:>|<cell|>>|<row|<cell|>|<cell|>|<cell|
  <tabular|<tformat|<table|<row|<cell|<with|font-family|ss|Functional
  Programming> -- <small|<hlink|<verbatim|http://www.ii.uni.wroc.pl/~lukstafi/FPcourse>|http://www.ii.uni.wroc.pl/~lukstafi/FPcourse>>>>|<row|<cell|<with|font-family|ss|Programming
  in Pascal>>>|<row|<cell|<with|font-family|ss|Programming in
  Java>>>>>>>|<cell|>>|<row|<cell|>|<cell|>|<cell|Teaching
  assistant:>|<cell|>>|<row|<cell|>|<cell|>|<cell|
  <tabular|<tformat|<table|<row|<cell|<with|font-family|ss|Artificial
  Intelligence>>>|<row|<cell|<with|font-family|ss|Algorithmic Game
  Theory>>>|<row|<cell|<with|font-family|ss|Working in
  Linux>>>|<row|<cell|<with|font-family|ss|Data Stores and Data
  Mining>>>|<row|<cell|<with|font-family|ss|Multi-Agent
  Systems>>>|<row|<cell|<with|font-family|ss|Evolutionary
  Algorithms>>>|<row|<cell|<with|font-family|ss|Natural Language
  Processing>>>|<row|<cell|<with|font-family|ss|Neural
  Networks>>>>>>>|<cell|>>>>>

  <name|><new-page*><tabular|<tformat|<cwith|2|2|3|3|cell-col-span|2>|<cwith|6|6|3|3|cell-col-span|2>|<cwith|7|7|3|3|cell-col-span|2>|<cwith|13|13|3|3|cell-col-span|2>|<cwith|3|3|3|3|cell-col-span|2>|<cwith|1|1|1|1|cell-halign|r>|<cwith|2|2|1|1|cell-halign|r>|<cwith|10|10|3|3|cell-col-span|2>|<cwith|11|11|3|3|cell-col-span|2>|<table|<row|<cell|<strong|Open
  Source>>|<cell|>|<cell|<strong|Toss> --
  <hlink|<verbatim|http://sourceforge.net/projects/toss>|http://sourceforge.net/projects/toss>>>|<row|<cell|<strong|Projects>>|<cell|>|<cell|<with|font-family|ss|hybrid
  modeling, multi-player games, GGP, logic,
  constraints>>>|<row|<cell|>|<cell|>|<cell|<block|<tformat|<cwith|1|1|1|1|cell-hyphen|t>|<cwith|1|1|1|1|cell-width|112mm>|<cwith|1|1|1|1|cell-hmode|exact>|<table|<row|<\cell>
    Uses logic, General Game Playing techniques and learning game rules to
    model hybrid and/or multi-agent systems. Hybrid models involve discrete
    transitions based on quantified relational constraints and graph
    rewriting, and continuous transitions by differential equations. Learning
    generates possible transition rules and winning conditions. Automatically
    derived heuristics allow game AI achieve provided or learned goals.
    Implemented in OCaml.
  </cell>>>>>>>|<row|<cell|>|<cell|>|<cell|>>|<row|<cell|>|<cell|>|<cell|<strong|InvarGenT>
  -- <hlink|<verbatim|https://github.com/lukstafi/invargent>|https://github.com/lukstafi/invargent>>>|<row|<cell|>|<cell|>|<cell|<with|font-family|ss|type
  systems, GADTs, invariant generation, postconditions,
  abduction>>>|<row|<cell|>|<cell|>|<cell|<block|<tformat|<cwith|1|1|1|1|cell-hyphen|t>|<cwith|1|1|1|1|cell-width|112mm>|<cwith|1|1|1|1|cell-hmode|exact>|<table|<row|<\cell>
    Infers types that use Guarded Algebraic Data Types and existential types,
    i.e. dependent types restricted to specific constraint domains. Given
    invariants of data-types, and recursive definitions, without types, in
    the core Caml language, derives the invariants: the constraints over
    inputs of functions and their relation to outputs; and postconditions:
    the constraints over outputs of functions. Elegantly extends the GADT
    system already present in OCaml and Haskell. Handles linear arithmetics
    and can integrate more constraint domains. Based on constraint abduction.
  </cell>>>>>>>|<row|<cell|>|<cell|>|<cell|>>|<row|<cell|>|<cell|>|<cell|<strong|Speagram>
  -- <hlink|<verbatim|http://toss.sourceforge.net/term.html>|http://toss.sourceforge.net/term.html>>>|<row|<cell|>|<cell|>|<cell|<with|font-family|ss|parsing,
  term reconstruction and rewriting, subtyping,
  NLP>>>|<row|<cell|>|<cell|>|<cell|<block|<tformat|<cwith|1|1|1|1|cell-hyphen|t>|<cwith|1|1|1|1|cell-width|112mm>|<cwith|1|1|1|1|cell-hmode|exact>|<table|<row|<\cell>
    Reconstructs rich term structures from user input by composing
    overlapping substructures that correspond to words and phrases. Global
    composition constraints disambiguate parsed text. Term rewriting allows
    postprocessing of results and seamless extension of a grammar by
    user-provided rules. Now part of the Toss project.
  </cell>>>>>>>|<row|<cell|>|<cell|>|<cell|>>|<row|<cell|>|<cell|>|<cell|<strong|pmwiki-mode>
  -- <hlink|<verbatim|http://sourceforge.net/projects/pmwiki-mode>|http://sourceforge.net/projects/pmwiki-mode>>>|<row|<cell|>|<cell|>|<cell|<with|font-family|ss|Emacs,
  elisp, http, markup>>>|<row|<cell|>|<cell|>|<cell|<block|<tformat|<cwith|1|1|1|1|cell-hyphen|t>|<cwith|1|1|1|1|cell-width|112mm>|<cwith|1|1|1|1|cell-hmode|exact>|<table|<row|<\cell>
    Emacs mode for editing PmWiki pages.
  </cell>>>>>>>|<row|<cell|>|<cell|>|<cell|>>|<row|<cell|<strong|INTERESTS>>|<cell|>|<cell|artificial
  intelligence, AGI, machine learning, cognitive
  science,>>|<row|<cell|<strong|& HOBBIES>>|<cell|>|<cell|analytic
  philosophy, ballet and contemporary dance, poetry>>>>>
</body>