TFPIE2025 - Revision history

RoseBohrer: /* The Programme Committee */

2025-02-17T15:11:12Z

The Programme Committee

← Older revision		Revision as of 15:11, 17 February 2025
Line 33:		Line 33:

	== The Programme Committee ==		== The Programme Committee ==

	~~The Programme Committee for 2025 is still recruiting, you are welcome to contact the chair if you are interested in joining.~~

	* [https://users.wpi.edu/~rbohrer/ ''Rose Bohrer (Chair)''] - Worcester Polytechnic Institute, USA		* [https://users.wpi.edu/~rbohrer/ ''Rose Bohrer (Chair)''] - Worcester Polytechnic Institute, USA

RoseBohrer: /* Programme */

2025-01-07T18:35:21Z

Programme

← Older revision		Revision as of 18:35, 7 January 2025
Line 75:		Line 75:

	== Programme ==		== Programme ==
			Session 1 (chair: Rose Bohrer)
	[[9:00-10:00]] Keynote: '''Fractal Foundations and Galactic Graphs: Structure and Strategy for Expanding Minds''' ''Nicolas Wu'' - Imperial College London		[[9:00-10:00]] Keynote: '''Fractal Foundations and Galactic Graphs: Structure and Strategy for Expanding Minds''' ''Nicolas Wu'' - Imperial College London

Line 81:		Line 82:
	[[10:35-11:05]] Coffee		[[10:35-11:05]] Coffee

			Session 2 (chair: Mart Lubbers)
	[[11:05-11:40]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA		[[11:05-11:40]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA

Line 86:		Line 88:

	[[12:15-14:10]] Lunch		[[12:15-14:10]] Lunch

			Session 3 (chair: Alex Gerdes)

	[[14:10-14:45]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA		[[14:10-14:45]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA
Line 92:		Line 96:

	[[15:20-15:50]] Tea		[[15:20-15:50]] Tea

			Session 4 (chair: Marco Morazan)

	[[15:50-16:25]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany		[[15:50-16:25]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany

RoseBohrer: /* Programme */

2024-12-30T15:59:04Z

Programme

← Older revision		Revision as of 15:59, 30 December 2024
Line 83:		Line 83:
	[[11:05-11:40]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA		[[11:05-11:40]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA

	[[11:40-12:15]]'''Design Support for Multitape Turing Machines''' ''Marco T. Morazan, Oliwia Kempinski and Andres Garced'' - Seton Hall University, South Orange, New Jersey, USA		[[11:40-12:15]] '''Design Support for Multitape Turing Machines''' ''Marco T. Morazan, Oliwia Kempinski and Andres Garced'' - Seton Hall University, South Orange, New Jersey, USA

	[[12:15-14:10]] Lunch		[[12:15-14:10]] Lunch
Line 89:		Line 89:
	[[14:10-14:45]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA		[[14:10-14:45]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA

	[[14:45-15:20]]'''Visual Execution and Validation of Finite-State Machines and Pushdown Automata''' ''Marco T. Morazan, David Anthony K. Fields, Andres Garced and Tijana Minić'' - Seton Hall University, South Orange, New Jersey, USA		[[14:45-15:20]] '''Visual Execution and Validation of Finite-State Machines and Pushdown Automata''' ''Marco T. Morazan, David Anthony K. Fields, Andres Garced and Tijana Minić'' - Seton Hall University, South Orange, New Jersey, USA

	[[15:20-15:50]] Tea		[[15:20-15:50]] Tea
Line 95:		Line 95:
	[[15:50-16:25]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany		[[15:50-16:25]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany

	[[16:25-17:00]]'''Intent Preserving Generation of Diverse and Idiomatic (Code-)Artifacts''' ''Oliver Westphal'' - Universität Duisburg-Essen, Germany		[[16:25-17:00]] '''Intent Preserving Generation of Diverse and Idiomatic (Code-)Artifacts''' ''Oliver Westphal'' - Universität Duisburg-Essen, Germany

	== Travel Authorization ==		== Travel Authorization ==
	Starting January 8th, all non-Europeans need an [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.		Starting January 8th, all non-Europeans need an [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.

RoseBohrer: /* Programme */

2024-12-30T15:33:25Z

Programme

← Older revision		Revision as of 15:33, 30 December 2024
Line 81:		Line 81:
	[[10:35-11:05]] Coffee		[[10:35-11:05]] Coffee

	[[11:05-12:15]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA		[[11:05-11:40]] '''A Design Recipe and Recipe-Based Errors for Regular Expressions''' ''Marco T. Morazan, Josephine Des Rosiers, Shamil Dzhatdoyev, Tijana Minić, Andrés M. Garced and David Anthony K. Fields'' - Seton Hall University, South Orange, New Jersey, USA

	'''Design Support for Multitape Turing Machines''' ''Marco T. Morazan, Oliwia Kempinski and Andres Garced'' - Seton Hall University, South Orange, New Jersey, USA		[[11:40-12:15]]'''Design Support for Multitape Turing Machines''' ''Marco T. Morazan, Oliwia Kempinski and Andres Garced'' - Seton Hall University, South Orange, New Jersey, USA

	[[12:15-14:10]] Lunch		[[12:15-14:10]] Lunch

	[[14:10-15:20]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA		[[14:10-14:45]] '''Using Tail Recursion, Big Integers, and Memoization to Implement a Scalable Fibonacci Sequence Function in OCaml''' ''Chang Liu'' - Ohio University, Athens, Ohio, USA

	'''Visual Execution and Validation of Finite-State Machines and Pushdown Automata''' ''Marco T. Morazan, David Anthony K. Fields, Andres Garced and Tijana Minić'' - Seton Hall University, South Orange, New Jersey, USA		[[14:45-15:20]]'''Visual Execution and Validation of Finite-State Machines and Pushdown Automata''' ''Marco T. Morazan, David Anthony K. Fields, Andres Garced and Tijana Minić'' - Seton Hall University, South Orange, New Jersey, USA

	[[15:20-15:50]] Tea		[[15:20-15:50]] Tea

	[[15:50-17:00]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany		[[15:50-16:25]] '''alea iacta est: A Declarative Domain-Specific Language for Manually Performable Random Experiments''' ''Baltasar Trancón Y Widemann and Markus Lepper'' - Brandenburg University of Applied Sciences, Germany

	~~'''Intent Preserving Generation of Diverse and Idiomatic (Code-)Artifacts''' ''Oliver Westphal'' - Universität Duisburg-Essen, Germany~~


			[[16:25-17:00]]'''Intent Preserving Generation of Diverse and Idiomatic (Code-)Artifacts''' ''Oliver Westphal'' - Universität Duisburg-Essen, Germany

	== Travel Authorization ==		== Travel Authorization ==
	Starting January 8th, all non-Europeans need an [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.		Starting January 8th, all non-Europeans need an [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.

RoseBohrer at 15:31, 30 December 2024

2024-12-30T15:31:51Z

@@ Line 73: / Line 73: @@
 All participants are welcome to attend all [https://trendsfp.github.io/index.html TFP] events.
 == Travel Authorization ==
 Starting January 8th, all non-Europeans need an  [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.

RoseBohrer at 18:59, 11 December 2024

2024-12-11T18:59:15Z

← Older revision		Revision as of 18:59, 11 December 2024
Line 73:		Line 73:

	All participants are welcome to attend all [https://trendsfp.github.io/index.html TFP] events.		All participants are welcome to attend all [https://trendsfp.github.io/index.html TFP] events.

			== Travel Authorization ==
			Starting January 8th, all non-Europeans need an [https://homeofficemedia.blog.gov.uk/electronic-travel-authorisation-eta-factsheet-november-2024/ ''Electronic Travel Authorization''] to enter the UK.

RoseBohrer: /* The Programme Committee */

2024-12-03T21:02:16Z

The Programme Committee

← Older revision		Revision as of 21:02, 3 December 2024
Line 42:		Line 42:
	* [https://www.cas.mcmaster.ca/~anand/ ''Christopher Anand''] - McMaster University, Hamilton, Canada		* [https://www.cas.mcmaster.ca/~anand/ ''Christopher Anand''] - McMaster University, Hamilton, Canada
	* [https://continuation.passing.style/ ''Guannan Wei''] - INRIA and ENS Paris, Paris, France		* [https://continuation.passing.style/ ''Guannan Wei''] - INRIA and ENS Paris, Paris, France
			* [https://zsv.web.elte.hu/ ''Viktoria Zsok''] - Eötvös Loránd University, Budapest, Hungary

	== How To Submit ==		== How To Submit ==

RoseBohrer: /* The Programme Committee */

2024-11-26T18:34:51Z

The Programme Committee

← Older revision		Revision as of 18:34, 26 November 2024
Line 38:		Line 38:
	* [https://users.wpi.edu/~rbohrer/ ''Rose Bohrer (Chair)''] - Worcester Polytechnic Institute, USA		* [https://users.wpi.edu/~rbohrer/ ''Rose Bohrer (Chair)''] - Worcester Polytechnic Institute, USA
	* [https://martlubbers.net/en/home.html ''Mart Lubbers''] - Radboud University Nijmegen, Netherlands		* [https://martlubbers.net/en/home.html ''Mart Lubbers''] - Radboud University Nijmegen, Netherlands
	* [https://prg.is.titech.ac.jp/people/cong/ ''Youyou Cong''] - ~~Tokyo~~ Institute of ~~Technology~~, Japan		* [https://prg.is.titech.ac.jp/people/cong/ ''Youyou Cong''] - Institute of Science Tokyo, Tokyo, Japan
	* [https://www.inf.elte.hu/en/staff/dr-melinda-toth ''Melinda Tóth''] - Eötvös Loránd University, Budapest, Hungary		* [https://www.inf.elte.hu/en/staff/dr-melinda-toth ''Melinda Tóth''] - Eötvös Loránd University, Budapest, Hungary
	* [https://www.cas.mcmaster.ca/~anand/ ''Christopher Anand''] - McMaster University, Hamilton, Canada		* [https://www.cas.mcmaster.ca/~anand/ ''Christopher Anand''] - McMaster University, Hamilton, Canada

RoseBohrer: /* How To Submit */

2024-11-15T20:20:40Z

How To Submit

← Older revision		Revision as of 20:20, 15 November 2024
Line 46:		Line 46:
	Paper submissions should be formatted in EPTCS style. We accept extended abstracts (4-6 pages) and full paper drafts (7-20 pages). For best-lecture presentations, we also accept short abstracts. Before the workshop, these submissions undergo an initial round of light review, performed primarily by the PC chair. Only full papers presented at the conference will be invited to the post-workshop process for full review by the PC. Preprints and slides will be shared on the workshop website.		Paper submissions should be formatted in EPTCS style. We accept extended abstracts (4-6 pages) and full paper drafts (7-20 pages). For best-lecture presentations, we also accept short abstracts. Before the workshop, these submissions undergo an initial round of light review, performed primarily by the PC chair. Only full papers presented at the conference will be invited to the post-workshop process for full review by the PC. Preprints and slides will be shared on the workshop website.

	Papers and abstracts can be submitted via EasyChair: [https://easychair.org/conferences/?conf=~~tfpie25~~ ''https://easychair.org/conferences/?conf=~~tfpie25~~'']		Papers and abstracts can be submitted via EasyChair:
			[https://easychair.org/conferences/?conf=tfpie2025 ''https://easychair.org/conferences/?conf=tfpie2025'']

	After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC.		After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC.

RoseBohrer: /* How To Submit */

2024-11-14T15:37:51Z

How To Submit

← Older revision		Revision as of 15:37, 14 November 2024
Line 44:		Line 44:

	== How To Submit ==		== How To Submit ==
	~~Potential presenters are invited to submit an~~ extended ~~abstract~~ (4-~~6 pages~~) ~~or a draft~~ paper (~~up to 20 pages~~) ~~in EPTCS style~~. ~~The authors~~ of ~~accepted presentations~~ will ~~have their preprints~~ and ~~their~~ slides ~~made available~~ on the workshop's website. Papers and abstracts can be submitted via EasyChair: [https://easychair.org/conferences/?conf=tfpie25 ''https://easychair.org/conferences/?conf=tfpie25'']		Paper submissions should be formatted in EPTCS style. We accept extended abstracts (4-6 pages) and full paper drafts (7-20 pages). For best-lecture presentations, we also accept short abstracts. Before the workshop, these submissions undergo an initial round of light review, performed primarily by the PC chair. Only full papers presented at the conference will be invited to the post-workshop process for full review by the PC. Preprints and slides will be shared on the workshop website.

			Papers and abstracts can be submitted via EasyChair: [https://easychair.org/conferences/?conf=tfpie25 ''https://easychair.org/conferences/?conf=tfpie25'']

	After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC.		After the workshop, presenters are invited to submit (a revised version of) their article for review. The PC will select the best articles for publication in the Electronic Proceedings in Theoretical Computer Science (EPTCS). Articles rejected for presentation and extended abstracts will not be formally reviewed by the PC.

			If you wish to make a submission outside the above formats, please contact the PC chair to discuss. Because TFPiE aims to encourage creative and experimental research ideas, we may be able to accommodate some non-traditional submissions on a case-by-case basis.

	== Invited Keynote ==		== Invited Keynote ==