Skip to content

Commit

Permalink
Merge pull request #9 from scottish-pl-institute/missing-meetings
Browse files Browse the repository at this point in the history
add missing HW'05 SPLS that I grabbed from web archive
  • Loading branch information
SimonJF authored Jul 2, 2024
2 parents fa63036 + 09bb70c commit 7cdd882
Show file tree
Hide file tree
Showing 7 changed files with 224 additions and 1 deletion.
2 changes: 1 addition & 1 deletion README.md
Original file line number Diff line number Diff line change
Expand Up @@ -100,6 +100,6 @@ SPLS receives financial support from the [Theory, Modelling and Computation](htt
+ [Thursday 1st June 2006, Heriot-Watt University](meetings/archive/www.dcs.gla.ac.uk/research/spls/Jun06.html).
+ [Wednesday 1st February 2006, University of St Andrews](meetings/archive/eb.host.cs.st-andrews.ac.uk/spls5.html).
+ Tuesday 25th October 2005, University of Strathclyde.
+ Thursday 23rd June 2005, Heriot-Watt University.
+ [Thursday 23rd June 2005, Heriot-Watt University](meetings/archive/www.macs.hw.ac.uk/trinder/spls05/).
+ [Friday 4th March 2005, University of Edinburgh](meetings/archive/www.dcs.gla.ac.uk/research/spls/Mar05/).
+ [Tuesday 7th December 2004, University of Glasgow](meetings/archive/www.dcs.gla.ac.uk/research/spls/Dec04.html).
35 changes: 35 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/Benoit.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,35 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- saved from url=(0095)https://web.archive.org/web/20060709053758/http://www.macs.hw.ac.uk/~trinder/spls05/Benoit.html -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<h1>Enhancing the performance of Grid Applications with Skeletons
and Process Algebras</h1>

<h2>Dr Anne Benoit, Edinburgh University</h2>

In a context of Grid programming, a skeleton-based approach recognises
that many real applications draw from a range of well-known solution
paradigms and seeks to make it easy for an application developer to
tailor such a paradigm to a specific problem. Powerful structuring
concepts are presented to the application programmer as a library of
pre-defined "skeletons".
<p>
In the eSkel project <a href="https://web.archive.org/web/20060709053758/http://homepages.inf.ed.ac.uk/abenoit1/eSkel">Edinburgh Skeleton
Library</a>, motivated by our observations on previous attempts to
implement these ideas, we have begun to define a generic set of
skeletons as a library of C functions on top of MPI. The first part of
the talk will focus on the library eSkel, presenting the main
fundamental concepts which form the basis of the library.
</p><p>
The use of a particular skeleton of the eSkel library carries with it
considerable information about implied scheduling dependencies. I will
present in the second part of the talk how we exploit these
information in the Enhance project (http://groups.inf.ed.ac.uk/enhance),
by modelling these skeletons with stochastic process algebras
(PEPA). This modelling process is automated, and since grid technology
provides facilities for dynamic monitoring of resource performance,
our approach supports adaptive rescheduling of applications.
</p><p>



</p></body></html>
27 changes: 27 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/Connor.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- saved from url=(0095)https://web.archive.org/web/20060709054341/http://www.macs.hw.ac.uk/~trinder/spls05/Connor.html -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<h1>Typed vs Untyped: performing a real experiment?</h1>

<h2>Prof Richard Connor, Strathclyde University</h2>

The long debate about whether static type systems are actually useful or
not, in terms of software productivity, quality, and maintenance, has
largely fizzled out with the acceptance of Java as a nondescript de facto
standard for software production. In its prime, the debate excited a great
deal of opinion, in the spectrum of reasoned argument, religious polemic,
and the burning of heretics by both sides.
<p>
What it lacked was any real evidence either way, by experiment or otherwise.
The essential difficulty is that forming a useful experiment over large
groups of progammers skilled in different languages was, and is, essentially
infeasible in terms of cost.
</p><p>
This talk outlines what we believe is a novel approach to the question,
which might lead to the gathering of some real experimental evidence about
this important, and undeservedly forgotten, question.
</p><p>



</p></body></html>
28 changes: 28 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/Hutchins.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- saved from url=(0097)https://web.archive.org/web/20060709054541/http://www.macs.hw.ac.uk/~trinder/spls05/Hutchins.html -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<h1>Feature Oriented Programming</h1>

<h2>DeLesley Hutchins, Edinburgh University</h2>

Feature-oriented programming is a mechanism for program composition
which is similar to aspect-oriented programming and multi-dimensional
separation of concerns. A feature is a high-level unit of program
behavior. Typically, features cannot be encapsulated within a single
function or class; instead, they cross-cut the implementation of many
functions and classes throughout the source code.
<p>
In this talk, I will give a brief introduction to features, and discuss
why they are useful, and how they are related to other approaches. I
will then introduce a simple "feature calculus". Current
implementations of features have no formal semantics. They are layered
on top of Java or C++, and are implemented by means of source code
transformation. In my calculus, feature composition is treated as a
form of type intersection over self-recursive records. I believe that
this is a particularly elegant way of thinking about features, and one
which clearly shows how they fit in to the larger realm of progamming
languages in general.



</p></body></html>
29 changes: 29 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/McBride.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- saved from url=(0096)https://web.archive.org/web/20060709054504/http://www.macs.hw.ac.uk/~trinder/spls05/McBride.html -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

<h1>Idioms</h1>

<h2>Conor McBride, Nottingham University</h2>
In a tale from the implementation of Epigram, I shall tell of an
abstraction which made itself too useful to ignore. Idioms are a
class of functor equipped with a 'return' and an 'application'. In
Haskell,
<p>
class Idiom i where<br>
ii :: x -&gt; i x<br>
(&lt;%&gt;) :: i (s -&gt; t) -&gt; i s -&gt; i t<br>
</p><p>
Idioms provide a notion of effectful computation which is more
limited than the monadic notion, but by the same token, more readily
available. Every monad induces an idiom but, without a 'bind', idioms
do not necessarily allow values from one computation to determine the
effects in another. This extra rigidity makes idioms closed under
composition without further ado. Many type constructors admit the
'threading' of idiomatic computations in a standard way, leading to a
small collection of powerful programming combinators with a diverse
array of uses which I shall illustrate by a variety of examples.



</p></body></html>
32 changes: 32 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/Scholz.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,32 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<!-- saved from url=(0095)https://web.archive.org/web/20060709054400/http://www.macs.hw.ac.uk/~trinder/spls05/Scholz.html -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">

<h1>Using Subtypes and Intersection Types to Strike the Balance Between Static and Dynamic Typing</h1>

<h2>Dr Sven-Bodo Scholz, Unievrsity of Hertfordshire</h2>

<p>
In array programming, the most common domain error encountered is
out-of-bound selection. Unfortunately these errors cannot be statically
detected unless either the source language is substantially restricted
or the type system is rendered undecidable.
</p><p>
In the context of Single Assignment C ( or SaC for short) we have
developed a hybrid approach. We do not restrict the source language
but introduce runtime checks in those situation where we statically
cannot decide whether they are free of domain errors or not. This is
achieved by introducing a hierarchy of array types and a form of
intersection types which allow the level of static type inference
to be adjusted dynamically.
</p><p>
For many programs this approach detects all domain inconsistencies
statically. However, in those situations where such a statical analysis
is not feasible a less precise approximation can be made deferring some
of the domain checks to runtime. This comes for the price of a type
inference which is unique modulo subtyping only, but allows all potentially
correct programs to be compiled and run.



</p></body></html>
72 changes: 72 additions & 0 deletions meetings/archive/www.macs.hw.ac.uk/trinder/spls05/index.html
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@

<!-- saved from url=(0084)https://web.archive.org/web/20060710214310/http://www.macs.hw.ac.uk/~trinder/spls05/ -->
<html><head><meta http-equiv="Content-Type" content="text/html; charset=windows-1252">
<h2>SPLS Meeting: Thursday 23rd June 2005</h2>

<h3>Introduction</h3>

The June 2005 SPLS meeting is the third in the <a href="https://web.archive.org/web/20060710214310/http://www.dcs.gla.ac.uk/research/spls/">Scottish Programming
Languages Seminar</a> series. The meetings are open and interested
participants are encouraged to attend.


<h3>Location</h3>

<p>
International Centre for Mathematical Sciences<br>
14 India Street<br>
Edinburgh, EH3 6EZ<br>
Tel: +44 (0) 131 220 1777<br>
</p>

<p>
Information on travelling to the ICMS can be found <a href="https://web.archive.org/web/20060710214310/http://www.icms.org.uk/travel/index.html">here</a>.
</p>

<h3>Draft Programme</h3>

<ul>
<li><b>13:00</b> <b>Pre-meeting coffee</b>
</li>
<li><b>13:20</b> <b>Welcome</b>
</li>
<li><b>13:30</b> <br>
Richard Connor, Strathclyde University<br>
<a href="Connor.html">Typed vs Untyped: performing a real experiment?</a>
</li>
<li><b>14:10</b> <br>
Anne Benoit, Edinburgh University<br>
<a href="Benoit.html">Enhancing the performance of Grid Applications with Skeletons
and Process Algebras</a>
</li>
<li><b>14:50</b> <br>
Conor McBride, Nottingham University<br>
<a href="McBride.html">Idioms</a><br>
</li>
<li><b>15:30</b> <b>Coffee break</b>
</li><li><b>16:00</b> <br>
DeLesley Hutchins, Edinburgh University<br>
<a href="Hutchins.html">Feature Oriented Programming</a><br>
</li>
<li><b>16:40</b> <br>
Sven-Bodo Sholz, University of Hertfordshire<br>
<a href="Scholz.html">Using Sub-types and Intersection Types to strike the Balance
Between Static and Dynamic Typing</a><br>
</li>
<li><b>17:20</b> <b>Close</b>
</li>
</ul>
<h3>Contact</h3>

You can contact the SPLS community via the <a href="http://www.dcs.gla.ac.uk/research/spls/">SPLS page</a>, or
contact the event organisers:
<p>

<a href="https://web.archive.org/web/20060710214310/http://www.macs.hw.ac.uk/~greg/">Greg Michaelson</a> and <a href="https://web.archive.org/web/20060710214310/http://www.macs.hw.ac.uk/~trinder/"> Phil Trinder</a><br>
School of Mathematical and Computer Sciences<br>
Heriot-Watt University<br>
Edinburgh, EH14 4AS<br>



</p></body></html>

0 comments on commit 7cdd882

Please sign in to comment.