Independent scholarship · Open accessThe monthly digest

Indexed text attachment

coherent-specialization-on-graalvm.tex

Source for Coherent Specialization on GraalVM

View paper · Download original file

Lines 661–760 of 803. Source text is displayed literally.

661Table~\ref{tab:sweep-check} gives maximum errors across the 303662compiled states from the three sweeps. Reference error uses the largest663absolute difference of a real or imaginary amplitude component. The664reproducibility archive includes the original CSVs, the Java exporter665with an absolute tolerance of $2\,10^{-12}$, and the script that renders666Figures~\ref{fig:electron-sweep} and~\ref{fig:field-sweep}.667 668 669\section{Scope and limitations}670 671The certification and gluing statements are mathematical theorems.672The implementation realizes a first-order fragment with finite contexts,673read-only inputs and static data, and lexical bindings. The software674executes ordinary typed arithmetic. The higher path witnesses used in the675theorems are mathematical objects rather than proof terms serialized by676the runtime. Extending the language with effects, exceptions, unbounded677iteration, or observation of machine representation would require a678revised semantic equivalence and proof of the residual transformations.679 680The numerical examples are finite quantum simulations. The single681electron is spinless with periodic boundary conditions and a682finite-difference Hamiltonian. The interacting field models spinless683fermions in a finite set of sites and a fixed number sector. Full684continuum field simulation, spin, and electromagnetic radiation require685different state spaces and operators. The size of a fixed-number sector686grows binomially with the number of sites, which limits dense compilation.687 688The code measures the size of residual syntax and checks specified689observations. A JIT compilation trace records the actual compilation690event. Source and residual node counts do not estimate machine instruction691counts or execution time. Correctness of the machine-code generation,692the guest interoperability implementations, and their exception handling693is an obligation of the underlying JVM and GraalVM implementations.694 695\paragraph{Artifact and disclosure.}696The accompanying source archive contains the implementations, guest697scripts, build descriptor, test suite, simulation data, figure generator,698and LaTeX sources.699The manuscript and software were produced with AI assistance, including700drafting, code generation, and verification. The responsible submitter uses an anonymous public byline.701 702\begin{thebibliography}{12}703 704\bibitem{graalpe}705GraalVM.706\emph{Partial Evaluation in Truffle}.707\href{https://www.graalvm.org/latest/graalvm-as-a-platform/language-implementation-framework/PartialEvaluation/}{GraalVM documentation}.708 709\bibitem{graalinterop}710GraalVM.711\emph{InteropLibrary}.712\href{https://www.graalvm.org/truffle/javadoc/com/oracle/truffle/api/interop/InteropLibrary.html}{Truffle API documentation}.713 714\bibitem{graalroot}715GraalVM.716\emph{RootNode}.717\href{https://www.graalvm.org/truffle/javadoc/com/oracle/truffle/api/nodes/RootNode.html}{Truffle API documentation}.718 719\bibitem{graalprofile}720GraalVM.721\emph{CountingConditionProfile}.722\href{https://www.graalvm.org/truffle/javadoc/com/oracle/truffle/api/profiles/CountingConditionProfile.html}{Truffle API documentation}.723 724\bibitem{wuerthinger}725T.~W\"urthinger, C.~Wimmer, C.~Humer, A.~W\"o\ss, L.~Stadler,726C.~Seaton, G.~Duboscq, D.~Simon, and M.~Grimmer.727Practical partial evaluation for high-performance dynamic language runtimes.728\emph{PLDI}, pp.~662--676, 2017.729\href{https://doi.org/10.1145/3062341.3062381}{DOI}.730 731\bibitem{futamura}732Y.~Futamura.733Partial evaluation of computation process---An approach to a compiler-compiler.734\emph{Computer Software} 21(5), pp.~343--351, 2004.735\href{https://doi.org/10.11309/jssst.21.343}{DOI}.736 737\bibitem{jgs}738N.~D. Jones, C.~K. Gomard, and P.~Sestoft.739\emph{Partial Evaluation and Automatic Program Generation}.740Prentice Hall, 1993.741\href{https://raspi.itu.dk/people/sestoft/pebook/pebook.html}{Author's edition}.742 743\bibitem{daviespfenning}744R.~Davies and F.~Pfenning.745A modal analysis of staged computation.746\emph{J. ACM} 48(3), pp.~555--604, 2001.747\href{https://www.cs.cmu.edu/~fp/papers/jacm00.pdf}{Author's copy}.748 749\bibitem{lurie}750J.~Lurie.751\emph{Higher Topos Theory}, Annals of Mathematics Studies 170,752Princeton University Press, 2009.753\href{https://arxiv.org/abs/math/0608040}{Author's preprint}.754 755\bibitem{dwyerkan}756W.~G. Dwyer and D.~M. Kan.757Calculating simplicial localizations.758\emph{J. Pure Appl. Algebra} 18(1), pp.~17--35, 1980.759\href{https://doi.org/10.1016/0022-4049(80)90113-9}{DOI}.760