NL-FP dag 2017 - Revision history

CnczSysop at 12:15, 1 April 2025

2025-04-01T12:15:15Z

← Older revision		Revision as of 12:15, 1 April 2025
Line 81:		Line 81:
	Franseplaats 1<br>		Franseplaats 1<br>
	6511 VS Nijmegen<br>		6511 VS Nijmegen<br>
	[~~http~~://www.openstreetmap.org/?mlat=51.84878&mlon=5.86442#map=19/51.84878/5.86442 OpenStreetMap]		[https://www.openstreetmap.org/?mlat=51.84878&mlon=5.86442#map=19/51.84878/5.86442 OpenStreetMap]

	== Contact ==		== Contact ==

	[~~http~~://www.cs.ru.nl/staff/Markus.Klinik Markus Klinik]		[https://www.cs.ru.nl/staff/Markus.Klinik Markus Klinik]

	== Talks ==		== Talks ==

Markus Klinik: /* Contact */

2017-01-09T10:21:45Z

Contact

← Older revision		Revision as of 10:21, 9 January 2017
Line 86:		Line 86:

	[http://www.cs.ru.nl/staff/Markus.Klinik Markus Klinik]		[http://www.cs.ru.nl/staff/Markus.Klinik Markus Klinik]

	~~m.klinik@cs.ru.nl~~

	== Talks ==		== Talks ==

Markus Klinik: /* Registration, Cost, Deadline */

2017-01-09T10:21:33Z

Registration, Cost, Deadline

← Older revision		Revision as of 10:21, 9 January 2017
Line 37:		Line 37:
	== Registration, Cost, Deadline ==		== Registration, Cost, Deadline ==

	Please register by sending an email to ~~[mailto:m.klinik@cs.ru.nl?subject=NLFP2017%20Registration~~ Markus Klinik] including		Please register by sending an email to Markus Klinik including

	* Name		* Name

Markus Klinik: /* Program */

2017-01-09T08:56:18Z

Program

← Older revision		Revision as of 08:56, 9 January 2017
Line 59:		Line 59:
	* 10:45 - 11:10 Arjan Oortgiese - A Distributed Server Architecture for Task Oriented Programming		* 10:45 - 11:10 Arjan Oortgiese - A Distributed Server Architecture for Task Oriented Programming
	* 11:10 - 11:40 Break		* 11:10 - 11:40 Break
	* 11:40 - 12:05 Jan de Muijnck-Hughes - Type-Driven Design of Communicating Systems using Idris		* 11:40 - 12:05 [[:File:2017-FP-Dag-TDD-Sessions.pdf\|Jan de Muijnck-Hughes - Type-Driven Design of Communicating Systems using Idris]]
	* 12:05 - 12:30 Guillaume Allais - agdARGS: declarative hierarchical command line interfaces		* 12:05 - 12:30 Guillaume Allais - agdARGS: declarative hierarchical command line interfaces
	* 12:30 - 14:00 Lunch		* 12:30 - 14:00 Lunch

Markus Klinik: /* Christiaan Baaij - Translating recursive Haskell descriptions to circuits */

2017-01-05T12:56:52Z

Christiaan Baaij - Translating recursive Haskell descriptions to circuits

← Older revision		Revision as of 12:56, 5 January 2017
Line 205:		Line 205:
	After presenting our extension to System-F we show how we can implement the strict-state thread monad \ensuremath{\Conid{ST}} by using a returned existential type in specialising the polymorphic function which returns that type. Currently this monad is built-in into the runtime system of GHC and as such has become part of the language.		After presenting our extension to System-F we show how we can implement the strict-state thread monad \ensuremath{\Conid{ST}} by using a returned existential type in specialising the polymorphic function which returns that type. Currently this monad is built-in into the runtime system of GHC and as such has become part of the language.

	==== ~~Christiaan Baaij~~ - ~~Translating recursive Haskell descriptions to circuits~~ ====		==== Hendrik Folmer - SLAM on FPGA using CλaSH ====

	~~CλaSH (pronounced ‘clash’)~~ is a ~~functional hardware description language that borrows both its syntax and semantics from the functional programming language Haskell~~. ~~This is just~~ a ~~fancy way~~ of ~~saying that CλaSH~~ is ~~a compiler~~ for ~~Haskell, but instead of creating machine code~~ (~~like GHC~~)~~, or javascript (like GHCjs), CλaSH generates digital circuits (~~in ~~the form~~ of ~~VHDL or Verilog code)~~.		SLAM stands for simultaneous localization and mapping and is a mathematical
			problem in robotics with a potentially heavy computational load which is
			usually solved on a large computational system. Large computational systems
			consume a lot of energy which is not ideal for mobile robots. A field
			programmable gate array (FPGA) allow developers to create reconfigurable
			hardware architectures which could be more efficient in terms of energy
			compared to standard computer systems because it has parallel capabilities.

	One ~~problem that the CλaSH compiler faces, and currently doesn't even do,~~ is ~~unrolling recursive functions "in general"~~. ~~In practice, this~~ is ~~amortised by the fact that~~ the ~~CλaSH compiler has hard-coded knowledge to unroll well-known higher-order functions~~ (~~map, zipWith, etc.~~)		One aspect of SLAM is ICP (Iterative Closest Point). ICP is used to find
			the transformation between two sensor observations (laser range scans) to
	In this talk we explore ~~another option to unroll recursive descriptions at compile time, by~~ using ~~closed type families to encode our data-types, and type class methods for our recursive functions. The Glasgow Haskell compiler (GHC) will then unroll~~ the ~~recursive descriptions for us as part of its class instance resolution mechanism~~.		determine the movement of the robot. In this talk we explore a way how an
			ICP algorithm could be realized on an FPGA using the functional hardware
			description language CλaSH.

	==== Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages ====		==== Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages ====

Markus Klinik: /* Program */

2017-01-05T12:56:12Z

Program

← Older revision		Revision as of 12:56, 5 January 2017
Line 64:		Line 64:
	* 14:00 - 14:25 Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages		* 14:00 - 14:25 Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages
	* 14:25 - 14:50 Gert-Jan Bottu - Quantified class constraints in Haskell		* 14:25 - 14:50 Gert-Jan Bottu - Quantified class constraints in Haskell
	* 14:50 - 15:15 ~~Christiaan Baaij~~ - ~~Translating recursive Haskell descriptions to circuits~~		* 14:50 - 15:15 Hendrik Folmer - SLAM on FPGA using CλaSH
	* 15:15 - 15:45 Break		* 15:15 - 15:45 Break
	* 15:45 - 16:10 Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts		* 15:45 - 16:10 Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts

Markus Klinik: /* Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts */

2017-01-05T12:48:54Z

Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts

← Older revision		Revision as of 12:48, 5 January 2017
Line 199:		Line 199:
	==== Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts ====		==== Doaitse Swierstra - Build your own ST Monad with Polymorphic Contexts ====

	~~lorem ipsum~~		Most type systems that support polymorphic functions are based on a version of System-F. We argue that this limits useful programming paradigms for languages with lazy evaluation. We motivate an extension of System-F alleviating this limitation.

			We in particular argue that in such languages the relationship between polymorphic and existential types can be made more systematic by allowing to pass back (part of) an existential result of a function call as an argument to the the function call that produced that value.

			After presenting our extension to System-F we show how we can implement the strict-state thread monad \ensuremath{\Conid{ST}} by using a returned existential type in specialising the polymorphic function which returns that type. Currently this monad is built-in into the runtime system of GHC and as such has become part of the language.

	==== Christiaan Baaij - Translating recursive Haskell descriptions to circuits ====		==== Christiaan Baaij - Translating recursive Haskell descriptions to circuits ====

Markus Klinik: /* Program */

2017-01-03T13:23:44Z

Program

← Older revision		Revision as of 13:23, 3 January 2017
Line 62:		Line 62:
	* 12:05 - 12:30 Guillaume Allais - agdARGS: declarative hierarchical command line interfaces		* 12:05 - 12:30 Guillaume Allais - agdARGS: declarative hierarchical command line interfaces
	* 12:30 - 14:00 Lunch		* 12:30 - 14:00 Lunch
	* 14:00 - 14:25 Jan Martin Jansen - ~~tbd~~		* 14:00 - 14:25 Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages
	* 14:25 - 14:50 Gert-Jan Bottu - Quantified class constraints in Haskell		* 14:25 - 14:50 Gert-Jan Bottu - Quantified class constraints in Haskell
	* 14:50 - 15:15 Christiaan Baaij - Translating recursive Haskell descriptions to circuits		* 14:50 - 15:15 Christiaan Baaij - Translating recursive Haskell descriptions to circuits

Markus Klinik: /* Jan Martin Jansen - tbd */

2017-01-03T13:23:19Z

Jan Martin Jansen - tbd

← Older revision		Revision as of 13:23, 3 January 2017
Line 209:		Line 209:
	In this talk we explore another option to unroll recursive descriptions at compile time, by using closed type families to encode our data-types, and type class methods for our recursive functions. The Glasgow Haskell compiler (GHC) will then unroll the recursive descriptions for us as part of its class instance resolution mechanism.		In this talk we explore another option to unroll recursive descriptions at compile time, by using closed type families to encode our data-types, and type class methods for our recursive functions. The Glasgow Haskell compiler (GHC) will then unroll the recursive descriptions for us as part of its class instance resolution mechanism.

	==== Jan Martin Jansen - ~~tbd~~ ====		==== Jan Martin Jansen - A Portable VM-based implementation Platform for non-strict Functional Programming Languages ====

	~~tdb~~		The Web has become a paramount deployment platform for computer
			applications. Modern Web-application require execution of code on both
			server- and client-side. For the client-side JavaScript is the more-or-less
			default platform for execution of code. Users of Functional Programming
			languages like Haskell and Clean, who want to develop their software
			completely in these languages, should rely on dedicated methods to
			transform their code to something that can be executed on top of
			JavaScript. In this talk we introduce a Virtual Machine that is capable of
			efficient execution of bytecode generated by a compiler for a non-strict
			intermediate functional language. The virtual machine has several
			implementations supporting the same bytecode, including JavaScript and
			asm.js versions. In this way we obtain a portable execution platform for
			non-strict Functional languages with a better client-side performance than
			existing client-side execution platforms.

	== Past NL-FP Days ==		== Past NL-FP Days ==

Markus Klinik: /* Program */

2017-01-03T11:23:24Z

Program

← Older revision		Revision as of 11:23, 3 January 2017
Line 53:		Line 53:

	== Program ==		== Program ==

	~~A preliminary sketch of the day.~~

	* 9:30 - 10:15 Registration		* 9:30 - 10:15 Registration