Mercurial > hg > Papers > 2015 > atton-lola

changeset 10:e1f4ace7c818

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add reference
author Yasutaka Higa <e115763@ie.u-ryukyu.ac.jp>
date Sun, 19 Apr 2015 12:16:14 +0900
parents 3509599ded39
children 079a9829d204
files .hgignore Makefile cfopm.pdf cfopm.tex reference.bib
diffstat 5 files changed, 97 insertions(+), 24 deletions(-) [+]
line wrap: on
line diff
--- a/.hgignore	Sun Apr 19 11:55:56 2015 +0900
+++ b/.hgignore	Sun Apr 19 12:16:14 2015 +0900
@@ -3,8 +3,13 @@
 .DS_Store
 *.swp
 
-*.log
 *.aux
+*.bbl
+*.blg
+*.cpt
 *.dvi
+*.lof
+*.log
+*.lol
+*.lot
 *.toc
-*.cpt
--- a/Makefile	Sun Apr 19 11:55:56 2015 +0900
+++ b/Makefile	Sun Apr 19 12:16:14 2015 +0900
@@ -7,6 +7,7 @@
 
 $(TARGET).dvi : $(wildcard **/*.tex) $(TARGET).tex
 	platex $(TARGET).tex
+	pbibtex $(TARGET)
 	platex $(TARGET).tex
 	platex $(TARGET).tex
 
@@ -15,7 +16,7 @@
 .PHONY : clean all open remake
 
 clean:
-	rm -f *.dvi *.aux *.log *.pdf *.ps *.gz *.bbl *.blg *.toc *~ *.core *.cpt
+	rm -f *.dvi *.aux *.log *.pdf *.ps *.gz *.bbl *.blg *.toc *~ *.core *.cpt *.lof *.lot *.lol *.bbl *.blg
 
 all: $(TARGET).pdf
 
Binary file cfopm.pdf has changed
--- a/cfopm.tex	Sun Apr 19 11:55:56 2015 +0900
+++ b/cfopm.tex	Sun Apr 19 12:16:14 2015 +0900
@@ -98,13 +98,13 @@
 \IEEEpeerreviewmaketitle
 
 \section{Continuation based C}  % enough only describe code/data segment?
-We proposed programming style using unit of program named code segment and data segment. % TODO: ref
+We proposed programming style using unit of program named code segment and data segment.
 Code segment is a unit of calculation not dependents state.
 Data segment contains values of calculation and calculation context called meta data segment.
 Execution of program is represented by moves interconnected code segments.
 Code/Data segment style programming was suitable to state based concurrent program.
 
-Programming language 'Continuation based C' (CbC) supported code/data segment style programming. % TODO: ref
+Programming language 'Continuation based C' (CbC\cite{DBLP:journals/corr/abs-1109-4048}) supported code/data segment style programming.
 CbC is lower language of C removed function call and loop-statements(for, while) and added continuation by goto and code segment.
 Code segment of CbC is function without return values in C.
 Interconnections of code segment represents goto with environment.
@@ -113,7 +113,7 @@
 
 \section{Meta computation and Monads}
 Meta computations in CbC formalized by Monads to prevent chaos by unlimited computations.
-Monads are a notion of Category Theory, in programs Monad correspondence of normal/meta computations.
+Monads are a notion of Category Theory, in programs Monad correspondence of normal/meta computations\ref{Moggi:1991:NCM:116981.116984}.
 For example, diverging computation as extended normal computations is represented direct sum of normal values and bottom.
 
 We show formalization of programs for using Monads.
@@ -230,7 +230,7 @@
 Delta contains two constructor Mono and Delta, Mono represents first version, Delta represents modification.
 Infix operator \verb/>>=/ handles extended abstraction has typed $ \verb/A/ \rightarrow \verb/Delta B/ $ recursive applies to each original versions.
 This definition represents simple modification only monotonic increase versioning (exclude branching and merging) and program has consistent type in all versions.
-We executed different versions in same time and proved satisfying Monad laws by proof assistant language Agda.
+We executed different versions in same time and proved satisfying Monad laws by proof assistant language Agda\cite{agda}.
 
 \section{Conclusion and Future Works}
 Handleable modification by meta computations is proposed.
@@ -336,22 +336,12 @@
 
 
 
-\section{Conclusion}
-The conclusion goes here.
-
 
 
 
 % conference papers do not normally have an appendix
 
 
-% use section* for acknowledgment
-\section*{Acknowledgment}
-
-
-The authors would like to thank...
-
-
 
 
 
@@ -377,14 +367,10 @@
 % <OR> manually copy in the resultant .bbl file
 % set second argument of \begin to the number of references
 % (used to reserve space for the reference number labels box)
-\begin{thebibliography}{1}
 
-\bibitem{IEEEhowto:kopka}
-H.~Kopka and P.~W. Daly, \emph{A Guide to \LaTeX}, 3rd~ed.\hskip 1em plus
-  0.5em minus 0.4em\relax Harlow, England: Addison-Wesley, 1999.
-
-\end{thebibliography}
-
+\nocite{agda, opac-b1092711, BarrM:cattcs, Girard:1989:PT:64805, JonesDuponcheel93}
+\bibliographystyle{jplain}
+\bibliography{reference}
 
 
 
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/reference.bib	Sun Apr 19 12:16:14 2015 +0900
@@ -0,0 +1,81 @@
+@article{DBLP:journals/corr/abs-1109-4048,
+  author    = {Shinji Kono and
+               Kento Yogi},
+  title     = {Implementing Continuation based language in {GCC}},
+  journal   = {CoRR},
+  volume    = {abs/1109.4048},
+  year      = {2011},
+  url       = {http://arxiv.org/abs/1109.4048},
+  timestamp = {Mon, 05 Dec 2011 18:05:37 +0100},
+  biburl    = {http://dblp.uni-trier.de/rec/bib/journals/corr/abs-1109-4048},
+  bibsource = {dblp computer science bibliography, http://dblp.org}
+}
+
+@book{Girard:1989:PT:64805,
+ author    = {Girard, Jean-Yves and Taylor, Paul and Lafont, Yves},
+ title     = {Proofs and Types},
+ year      = {1989},
+ isbn      = {0-521-37181-3},
+ publisher = {Cambridge University Press},
+ address   = {New York, NY, USA},
+}
+
+@book{opac-b1092711,
+   title     = "Introduction to higher order categorical logic",
+   author    = "Lambek, Joachim (mathématicien) and Scott, P. J.",
+   series    = "Cambridge studies in advanced mathematics",
+   publisher = "Cambridge University Press",
+   address   = "Cambridge, New York (N. Y.), Melbourne",
+   url       = "http://opac.inria.fr/record=b1092711",
+   isbn      = "0-521-24665-2",
+   year      = 1986
+}
+
+@book{BarrM:cattcs,
+    author    = {Barr, Michael and Wells, Charles},
+    title     = {Category Theory for Computing Science},
+    publisher = {Prentice-Hall},
+    series    = {International Series in Computer Science},
+    year      = 1990,
+    note      = {Second edition, 1995},
+    isbn      = {0-13-120486-6},
+    lccn      = {QA76.9.M35B37 1990}
+}
+
+@article{Moggi:1991:NCM:116981.116984,
+    author     = {Moggi, Eugenio},
+    title      = {Notions of Computation and Monads},
+    journal    = {Inf. Comput.},
+    issue_date = {July 1991},
+    volume     = {93},
+    number     = {1},
+    month      = jul,
+    year       = {1991},
+    issn       = {0890-5401},
+    pages      = {55--92},
+    numpages   = {38},
+    url        = {http://dx.doi.org/10.1016/0890-5401(91)90052-4},
+    doi        = {10.1016/0890-5401(91)90052-4},
+    acmid      = {116984},
+    publisher  = {Academic Press, Inc.},
+    address    = {Duluth, MN, USA},
+}
+
+
+@techreport{JonesDuponcheel93,
+    author      = {M. P. Jones and L. Duponcheel},
+    title       = {Composing monads},
+    institution = {Yale University},
+    year        = {1993},
+    month       = {December},
+    number      = {YALEU/DCS/RR-1004},
+    type        = {Research Report},
+    ftp         = {ftp://ftp.cs.nott.ac.uk/nott-fp/reports/yale/RR-1004.ps}
+}
+
+@misc{agda,
+    title = {The Agda wiki},
+    howpublished = {\url{http://wiki.portal.chalmers.se/agda/pmwiki.php}},
+    note = {Accessed: 2015/04/19(Sun)}
+}
+